IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v27y2023i3d10.1007_s10058-022-00316-4.html
   My bibliography  Save this article

The Sumo coach problem

Author

Listed:
  • Daniel Rehsmann

    (University of Vienna)

Abstract

We address the optimal allocation of stochastically dependent resource bundles to a set of simultaneous contests. For this purpose, we study a modification of the Colonel Blotto Game called the Tennis Coach Problem. We devise a thoroughly probabilistic method of payoff representation and fully characterize equilibria in this class of games. We further formalize the idea of strategic team training in a comparative static setting. The problem applies to several distinct economic interactions but seems most prevalent in team sports with individual matches, for instance, in Tennis and Sumo.

Suggested Citation

  • Daniel Rehsmann, 2023. "The Sumo coach problem," Review of Economic Design, Springer;Society for Economic Design, vol. 27(3), pages 669-700, September.
    • Handle: RePEc:spr:reecde:v:27:y:2023:i:3:d:10.1007_s10058-022-00316-4
    DOI: 10.1007/s10058-022-00316-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10058-022-00316-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10058-022-00316-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. W. Blackett, 1958. "Pure strategy solutions of blotto games," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 5(2), pages 107-109, June.
    2. Konrad, Kai A., 2009. "Strategy and Dynamics in Contests," OUP Catalogue, Oxford University Press, number 9780199549603.
    3. Qiang Fu & Jingfeng Lu & Yue Pan, 2015. "Team Contests with Multiple Pairwise Battles," American Economic Review, American Economic Association, vol. 105(7), pages 2120-2140, July.
    4. Kvasov, Dmitriy, 2007. "Contests with limited resources," Journal of Economic Theory, Elsevier, vol. 136(1), pages 738-748, September.
    5. Christopher Harris & John Vickers, 1987. "Racing with Uncertainty," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 54(1), pages 1-21.
    6. Sergiu Hart, 2008. "Discrete Colonel Blotto and General Lotto games," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 441-460, March.
    7. Hamilton, Jonathan & Romano, Richard E., 1998. "Equilibrium assignments in pairwise team contests: How to form political slates and tennis teams," European Journal of Political Economy, Elsevier, vol. 14(1), pages 101-114, February.
    8. Yosef Rinott & Marco Scarsini & Yaming Yu, 2012. "A Colonel Blotto Gladiator Game," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 574-590, November.
    9. Russell Golman & Scott Page, 2009. "General Blotto: games of allocative strategic mismatch," Public Choice, Springer, vol. 138(3), pages 279-299, March.
    10. Brian Roberson, 2006. "The Colonel Blotto game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 1-24, September.
    11. Dan Kovenock J. & Brian Roberson, 2010. "Conflicts with Multiple Battlefields," CESifo Working Paper Series 3165, CESifo.
    12. Alex Gershkov & Paul Schweinzer, 2021. "Dream teams and the Apollo effect," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 6(1), pages 113-148, December.
    13. Arad Ayala, 2012. "The Tennis Coach Problem: A Game-Theoretic and Experimental Study," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 12(1), pages 1-43, April.
    14. Snyder, James M, 1989. "Election Goals and the Allocation of Campaign Resources," Econometrica, Econometric Society, vol. 57(3), pages 637-660, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Deck, Cary & Hao, Li & Porter, David, 2015. "Do prediction markets aid defenders in a weak-link contest?," Journal of Economic Behavior & Organization, Elsevier, vol. 117(C), pages 248-258.
    2. Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2019. "The attack and defense of weakest-link networks," Public Choice, Springer, vol. 179(3), pages 175-194, June.
    3. Kimbrough, Erik O. & Laughren, Kevin & Sheremeta, Roman, 2020. "War and conflict in economics: Theories, applications, and recent trends," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 998-1013.
    4. Deck, Cary & Sarangi, Sudipta & Wiser, Matt, 2017. "An experimental investigation of simultaneous multi-battle contests with strategic complementarities," Journal of Economic Psychology, Elsevier, vol. 63(C), pages 117-134.
    5. Emmanuel Dechenaux & Dan Kovenock & Roman Sheremeta, 2015. "A survey of experimental research on contests, all-pay auctions and tournaments," Experimental Economics, Springer;Economic Science Association, vol. 18(4), pages 609-669, December.
    6. Shakun D. Mago & Roman M. Sheremeta, 2017. "Multi‐battle Contests: An Experimental Study," Southern Economic Journal, John Wiley & Sons, vol. 84(2), pages 407-425, October.
    7. Dan Kovenock & Brian Roberson, 2018. "The Optimal Defense Of Networks Of Targets," Economic Inquiry, Western Economic Association International, vol. 56(4), pages 2195-2211, October.
    8. David Rietzke & Brian Roberson, 2013. "The robustness of ‘enemy-of-my-enemy-is-my-friend’ alliances," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(4), pages 937-956, April.
    9. Subhasish M Chowdhury & Dan Kovenock & David Rojo Arjona & Nathaniel T Wilcox, 2021. "Focality and Asymmetry in Multi-Battle Contests," The Economic Journal, Royal Economic Society, vol. 131(636), pages 1593-1619.
    10. Dan Kovenock & Brian Roberson, 2015. "The Optimal Defense of Network Connectivity," Working Papers 15-24, Chapman University, Economic Science Institute.
    11. Shakun D. Mago & Roman M. Sheremeta, 2019. "New Hampshire Effect: behavior in sequential and simultaneous multi-battle contests," Experimental Economics, Springer;Economic Science Association, vol. 22(2), pages 325-349, June.
    12. Yosef Rinott & Marco Scarsini & Yaming Yu, 2012. "A Colonel Blotto Gladiator Game," Mathematics of Operations Research, INFORMS, vol. 37(4), pages 574-590, November.
    13. Dan Kovenock & Sudipta Sarangi & Matt Wiser, 2015. "All-pay 2 $$\times $$ × 2 Hex: a multibattle contest with complementarities," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 571-597, August.
    14. Zeynep B. Irfanoglu & Shakun D. Mago & Roman M. Sheremeta, 2014. "The New Hampshire Effect: Behavior in Sequential and Simultaneous Election Contests," Working Papers 14-15, Chapman University, Economic Science Institute.
    15. Aner Sela, 2021. "Resource Allocations In Multi-Stage Contests," Working Papers 2105, Ben-Gurion University of the Negev, Department of Economics.
    16. Aner Sela, 2023. "Resource allocations in the best-of-k ( $$k=2,3$$ k = 2 , 3 ) contests," Journal of Economics, Springer, vol. 139(3), pages 235-260, August.
    17. Subhasish Chowdhury & Dan Kovenock & Roman Sheremeta, 2013. "An experimental investigation of Colonel Blotto games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(3), pages 833-861, April.
    18. Casella, Alessandra & Laslier, Jean-François & Macé, Antonin, 2017. "Democracy for Polarized Committees: The Tale of Blotto's Lieutenants," Games and Economic Behavior, Elsevier, vol. 106(C), pages 239-259.
    19. Aner Sela, 2016. "Two Stage Contests With Effort-Dependent Rewards," Working Papers 1612, Ben-Gurion University of the Negev, Department of Economics.
    20. Nejat Anbarc{i} & Kutay Cingiz & Mehmet S. Ismail, 2020. "Proportional resource allocation in dynamic n-player Blotto games," Papers 2010.05087, arXiv.org, revised Jul 2022.

    More about this item

    Keywords

    Seeding; Contests; Teams; Latin square games;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D7 - Microeconomics - - Analysis of Collective Decision-Making
    • H4 - Public Economics - - Publicly Provided Goods
    • M3 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising

    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:spr:reecde:v:27:y:2023:i:3:d:10.1007_s10058-022-00316-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.