IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v4y1992i4p528-552.html
   My bibliography  Save this article

The complexity of two-person zero-sum games in extensive form

Author

Listed:
  • Koller, Daphne
  • Megiddo, Nimrod

Abstract

No abstract is available for this item.

Suggested Citation

  • Koller, Daphne & Megiddo, Nimrod, 1992. "The complexity of two-person zero-sum games in extensive form," Games and Economic Behavior, Elsevier, vol. 4(4), pages 528-552, October.
    • Handle: RePEc:eee:gamebe:v:4:y:1992:i:4:p:528-552
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0899-8256(92)90035-Q
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Srihari Govindan & Robert Wilson, 2012. "Axiomatic Equilibrium Selection for Generic Two‐Player Games," Econometrica, Econometric Society, vol. 80(4), pages 1639-1699, July.
    2. F. Forges & B. von Stengel, 2002. "Computionally Efficient Coordination in Games Trees," THEMA Working Papers 2002-05, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    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. Nataliya Sokolovska & Olivier Teytaud & Salwa Rizkalla & MicroObese consortium & Karine Clément & Jean-Daniel Zucker, 2015. "Sparse Zero-Sum Games as Stable Functional Feature Selection," PLOS ONE, Public Library of Science, vol. 10(9), pages 1-16, September.
    5. Stephan Schosser & Bodo Vogt, 2015. "What automaton model captures decision making? A call for finding a behavioral taxonomy of complexity," FEMM Working Papers 150010, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    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. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications,, Elsevier.
    8. von Stengel, Bernhard & Koller, Daphne, 1997. "Team-Maxmin Equilibria," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 309-321, October.
    9. Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 1-7, January.
    10. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a Three-Player Imperfect-Information Game," Games, MDPI, vol. 9(2), pages 1-8, June.
    11. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    12. Sam Ganzfried & Max Chiswick, 2019. "Most Important Fundamental Rule of Poker Strategy," Papers 1906.09895, arXiv.org, revised Feb 2020.
    13. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game," Papers 1804.04789, arXiv.org.
    14. Srihari Govindan & Robert Wilson, 2008. "Metastable Equilibria," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 787-820, November.
    15. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
    16. Sam Ganzfried & Farzana Yusuf, 2017. "Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy," Games, MDPI, vol. 8(4), pages 1-13, November.
    17. Etessami, Kousha, 2021. "The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game," Games and Economic Behavior, Elsevier, vol. 125(C), pages 107-140.
    18. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
    19. Rajgopal Kannan & Sudipta Sarangi & S. S. Iyengar, 2002. "Strategic Path Reliability in Information Networks," Discussion Papers of DIW Berlin 298, DIW Berlin, German Institute for Economic Research.
    20. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
    21. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.

    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:eee:gamebe:v:4:y:1992:i:4:p:528-552. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.