IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2501.07309.html
   My bibliography  Save this paper

Making Tennis Fairer: The Grand Tiebreaker

Author

Listed:
  • Steven J. Brams
  • Mehmet S. Ismail
  • D. Marc Kilgour

Abstract

Tennis, like other games and sports, is governed by rules, including the rules that determine the winner of points, games, sets, and matches. If the two players are equally skilled -- each has the same probability of winning a point when serving or when receiving -- we show that each has an equal chance of winning games, sets, and matches, whether or not sets go to a tiebreak. However, in a women's match that is decided by 2 out of 3 sets, and a men's match that is decided by 3 out of 5 sets, it is possible that the player who wins the most games may not be the player who wins the match. We calculate the probability that this happens and show that it has actually occurred -- most notably, in the 2019 men's Wimbledon final between Novak Djokovic and Roger Federer, which took almost five hours to complete and is considered one of the greatest tennis matches ever (Djokovic won). We argue that the discrepancy between the game winner and the match winner, when it occurs, should be resolved by a Grand Tiebreak (GT) -- played according to the rules of tiebreaks in sets -- because each player has a valid claim to being called the rightful winner. A GT would have the salutary effect of -- even every point -- lest he/she win in sets but lose more games. This would make competition keener throughout a match and probably decrease the need for a GT, because the game and set winner would more likely coincide when the players fight hard for every point.

Suggested Citation

  • Steven J. Brams & Mehmet S. Ismail & D. Marc Kilgour, 2025. "Making Tennis Fairer: The Grand Tiebreaker," Papers 2501.07309, arXiv.org.
  • Handle: RePEc:arx:papers:2501.07309
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2501.07309
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2501.07309. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.