IDEAS home Printed from https://ideas.repec.org/p/geo/guwopa/gueconwpa~23-23-03.html
   My bibliography  Save this paper

Disequilibrium Play in Tennis

Author

Abstract

Are the serves of the world’s best tennis pros consistent with the theoretical predictions of Nash equilibrium in mixed strategies? We analyze their serve direction choices (to the receiver’s left, right or body) with data from an online database called the Match Charting Project. Using a new methodology, we test and decisively reject a key implication of a mixed strategy Nash equilibrium, namely, that the probability of winning a service game is the same for all serve directions. We also use dynamic programming (DP) to numerically solve for the best-response serve strategies in models of the service game of tennis estimated for individual server-receiver pairs, such as Novak Djokovic serving to Rafael Nadal. We show that for most elite professional servers, the DP serve strategy significantly increases their service game win probability compared to the mixed strategies they actually use, which we estimate using flexible reduced-form logit models. Stochastic simulations verify that our results are robust to estimation error.

Suggested Citation

  • Axel Anderson & Jeremy Rosen & John Rust & Kin-ping Wong, 2023. "Disequilibrium Play in Tennis," Working Papers gueconwpa~23-23-03, Georgetown University, Department of Economics.
  • Handle: RePEc:geo:guwopa:gueconwpa~23-23-03
    as

    Download full text from publisher

    File URL: https://papers.ssrn.com/sol3/Delivery.cfm/SSRN_ID4383716_code5771759.pdf?abstractid=4383716&mirid=1
    File Function: Full text
    Download Restriction: None
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    tennis; games; Nash equilibrium; Minimax theorem; constant sum games; mixed strategies; dynamic directional games; binary Markov games; dynamic programming; structural estimation; muscle memory; magnification effect;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • L21 - Industrial Organization - - Firm Objectives, Organization, and Behavior - - - Business Objectives of the Firm

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:geo:guwopa:gueconwpa~23-23-03. 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: Marcia Suss (email available below). General contact details of provider: http://econ.georgetown.edu/ .

    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.