IDEAS home Printed from
   My bibliography  Save this article

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


  • Koller, Daphne
  • Megiddo, Nimrod


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

    Download full text from publisher

    File URL:
    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.

    References listed on IDEAS

    1. B. Curtis Eaton & Richard G. Lipsey, 1975. "The Principle of Minimum Differentiation Reconsidered: Some New Developments in the Theory of Spatial Competition," Review of Economic Studies, Oxford University Press, vol. 42(1), pages 27-49.
    2. Thomas R. Palfrey, 1984. "Spatial Equilibrium with Entry," Review of Economic Studies, Oxford University Press, vol. 51(1), pages 139-156.
    Full references (including those not matched with items on IDEAS)


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

    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. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications, Elsevier.
    3. von Stengel, Bernhard & Koller, Daphne, 1997. "Team-Maxmin Equilibria," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 309-321, October.
    4. 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.
    5. 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.
    6. 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.
    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. repec:gam:jgames:v:8:y:2017:i:4:p:49-:d:117807 is not listed on IDEAS
    9. 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.
    10. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
    11. 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.
    12. 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.
    13. 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.

    More about this item


    Access and download statistics


    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

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

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.