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

Two-Person adversarial games are zero-sum: A resolution of the Luce-Raiffa-Aumann (LRA) conjecture

Author

Listed:
  • M. Ali Khan
  • Arthur Paul Pedersen
  • David Schrittesser

Abstract

This letter: (i) reformulates the theorems of Adler-Daskalakis-Papadimitriou (2009) and Raimondo (2023) on two-player adversarial games as a generalized result with a simplified proof, (ii) forges connections to work on strategically zero-sum games by Moulin-Vial (1978), and on axiomatizations of multi-linear utilities of n-person games by Fishburn-Roberts (1976, 1978). The simplification and the connections on offer give prominence to two-person zero-sum games studied by Aumann (1961), Shapley (1964) and Rosenthal (1974), and also to recent algorithmic work in computer science. We give a productive reorientation to the subject by bringing the two communities together under the rubric of adversarial games.

Suggested Citation

  • M. Ali Khan & Arthur Paul Pedersen & David Schrittesser, 2024. "Two-Person adversarial games are zero-sum: A resolution of the Luce-Raiffa-Aumann (LRA) conjecture," Papers 2403.04029, arXiv.org, revised Mar 2024.
    • Handle: RePEc:arx:papers:2403.04029
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002. "Computing Normal Form Perfect Equilibria for Extensive Two-Person Games," Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
    2. Kats, Amoz & Thisse, Jacques-Francois, 1992. "Unilaterally Competitive Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 291-299.
    3. Joseph L. Heyman & Abhishek Gupta, 2023. "Rank Reduction in Bimatrix Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 25(01), pages 1-29, March.
    4. Raimondo, Roberto, 2023. "Strictly competitive games with infinitely many strategies," Economics Letters, Elsevier, vol. 233(C).
    5. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, March.
    6. MOULIN, Hervé & VIAL, Jean-Philippe, 1978. "Strategically zero-sum games: the class of games whose completely mixed equilibria connot be improved upon," LIDAM Reprints CORE 359, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Khan, M. Ali & Sun, Yeneng, 1999. "Non-cooperative games on hyperfinite Loeb spaces1," Journal of Mathematical Economics, Elsevier, vol. 31(4), pages 455-492, 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. Rahul Savani & Bernhard von Stengel, 2016. "Unit vector games," International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
    2. Stefanos Leonardos & Costis Melolidakis, 2018. "On the Commitment Value and Commitment Optimal Strategies in Bimatrix Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 20(03), pages 1-28, September.
    3. Hausken, Kjell, 2008. "Strategic defense and attack for reliability systems," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1740-1750.
    4. Rahul Savani & Bernhard Stengel, 2015. "Game Theory Explorer: software for the applied game theorist," Computational Management Science, Springer, vol. 12(1), pages 5-33, January.
    5. Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.
    6. Bernhard von Stengel & Françoise Forges, 2008. "Extensive-Form Correlated Equilibrium: Definition and Computational Complexity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 1002-1022, November.
    7. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    8. Abheek Ghosh & Paul W. Goldberg, 2023. "Best-Response Dynamics in Lottery Contests," Papers 2305.10881, arXiv.org.
    9. Al-Najjar, Nabil I., 2008. "Large games and the law of large numbers," Games and Economic Behavior, Elsevier, vol. 64(1), pages 1-34, September.
    10. Carmona, Guilherme, 2008. "Large games with countable characteristics," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 344-347, February.
    11. Jun Honda, 2015. "Games with the Total Bandwagon Property," Department of Economics Working Papers wuwp197, Vienna University of Economics and Business, Department of Economics.
    12. Konstantinos Georgalos & Indrajit Ray & Sonali SenGupta, 2020. "Nash versus coarse correlation," Experimental Economics, Springer;Economic Science Association, vol. 23(4), pages 1178-1204, December.
    13. Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002. "Computing Normal Form Perfect Equilibria for Extensive Two-Person Games," Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
    14. Takuya Iimura & Toshimasa Maruta & Takahiro Watanabe, 2020. "Two-person pairwise solvable games," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(2), pages 385-409, June.
    15. Cédric Wanko, 2008. "Approche Conceptuelle et Algorithmique des Equilibres de Nash Robustes Incitatifs," Working Papers 08-03, LAMETA, Universtiy of Montpellier, revised Feb 2008.
    16. Morales, Dolores Romero & Vermeulen, Dries, 2009. "Existence of equilibria in a decentralized two-level supply chain," European Journal of Operational Research, Elsevier, vol. 197(2), pages 642-658, September.
    17. Carmona, Guilherme & Podczeck, Konrad, 2009. "On the existence of pure-strategy equilibria in large games," Journal of Economic Theory, Elsevier, vol. 144(3), pages 1300-1319, May.
    18. Edward Cartwright & Myrna Wooders, 2009. "On equilibrium in pure strategies in games with many players," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 137-153, March.
    19. Naouel Yousfi-Halimi & Mohammed Said Radjef & Hachem Slimani, 2018. "Refinement of pure Pareto Nash equilibria in finite multicriteria games using preference relations," Annals of Operations Research, Springer, vol. 267(1), pages 607-628, August.
    20. Ozdogan, Ayca & Saglam, Ismail, 2021. "Correlated equilibrium under costly disobedience," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 98-104.

    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:2403.04029. 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: 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.