IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v242y2024ics0165176524003367.html
   My bibliography  Save this article

Two-Person Adversarial Games are Zero-Sum: An elaboration of a folk theorem

Author

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

Abstract

The observation that every two-person adversarial game is an affine transformation of a zero-sum game is traceable to Luce and Raiffa (1957) and made explicit in Aumann (1987). Recent work of Adler et al. (2009) and of Raimondo (2023) in increasing generality, proves what has so far remained a conjecture. We present two proofs of an even more general formulation: the first draws on multilinear utility theory developed by Fishburn and Roberts (1978); the second is a consequence of Adler et al.’s 2009 proof itself for a special case of a two-player game in which each player has a set of three actions.

Suggested Citation

  • Khan, M. Ali & Pedersen, Arthur Paul & Schrittesser, David, 2024. "Two-Person Adversarial Games are Zero-Sum: An elaboration of a folk theorem," Economics Letters, Elsevier, vol. 242(C).
    • Handle: RePEc:eee:ecolet:v:242:y:2024:i:c:s0165176524003367
    DOI: 10.1016/j.econlet.2024.111852
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176524003367
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2024.111852?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Raimondo, Roberto, 2023. "Strictly competitive games with infinitely many strategies," Economics Letters, Elsevier, vol. 233(C).
    2. 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).
    3. 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.
    4. 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.
    5. Khan, M. Ali & Sun, Yeneng, 2002. "Non-cooperative games with many players," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 46, pages 1761-1808, Elsevier.
    6. Karen Isaacson & C. B. Millham, 1980. "On a class of nash‐solvable bimatrix games and some related nash subsets," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(3), pages 407-412, September.
    7. Kats, Amoz & Thisse, Jacques-Francois, 1992. "Unilaterally Competitive Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 291-299.
    8. 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.
    9. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, March.
    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. Carmona, Guilherme, 2008. "Large games with countable characteristics," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 344-347, February.
    2. Khan, M. Ali & Rath, Kali P. & Sun, Yeneng & Yu, Haomiao, 2013. "Large games with a bio-social typology," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1122-1149.
    3. 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.
    4. 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.
    5. Wu, Bin, 2022. "On pure-strategy Nash equilibria in large games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 305-315.
    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. Jian Yang, 2017. "A link between sequential semi-anonymous nonatomic games and their large finite counterparts," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 383-433, May.
    8. Guilherme Carmona & Konrad Podczeck, 2022. "Approximation and characterization of Nash equilibria of large games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 73(2), pages 679-694, April.
    9. Khan, M. Ali Khan, 2007. "Perfect Competition," MPRA Paper 2202, University Library of Munich, Germany.
    10. Noguchi, Mitsunori, 2010. "Large but finite games with asymmetric information," Journal of Mathematical Economics, Elsevier, vol. 46(2), pages 191-213, March.
    11. 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.
    12. Hausken, Kjell, 2008. "Strategic defense and attack for reliability systems," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1740-1750.
    13. 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.
    14. Khan, M. Ali & Qiao, Lei & Rath, Kali P. & Sun, Yeneng, 2020. "Modeling large societies: Why countable additivity is necessary," Journal of Economic Theory, Elsevier, vol. 189(C).
    15. Khan, M. Ali & Zhang, Yongchao, 2014. "On the existence of pure-strategy equilibria in games with private information: A complete characterization," Journal of Mathematical Economics, Elsevier, vol. 50(C), pages 197-202.
    16. Carmona, Guilherme & Podczeck, Konrad, 2020. "Pure strategy Nash equilibria of large finite-player games and their relationship to non-atomic games," Journal of Economic Theory, Elsevier, vol. 187(C).
    17. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    18. Noguchi, Mitsunori, 2009. "Existence of Nash equilibria in large games," Journal of Mathematical Economics, Elsevier, vol. 45(1-2), pages 168-184, January.
    19. He, Wei & Sun, Xiang & Sun, Yeneng, 2017. "Modeling infinitely many agents," Theoretical Economics, Econometric Society, vol. 12(2), May.
    20. Fu, Haifeng & Xu, Ying & Zhang, Luyi, 2007. "Characterizing Pure-strategy Equilibria in Large Games," MPRA Paper 7514, University Library of Munich, Germany.

    More about this item

    Keywords

    Game Theory; Two-person Games; Strictly Competitive Games; Adversarial Games; Utility Theory;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D01 - Microeconomics - - General - - - Microeconomic Behavior: Underlying Principles

    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:eee:ecolet:v:242:y:2024:i:c:s0165176524003367. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.