IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v4y1992i4p528-552.html

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

Citations

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


Cited by:

  1. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications,, Elsevier.
  2. von Stengel, Bernhard & Koller, Daphne, 1997. "Team-Maxmin Equilibria," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 309-321, October.
  3. 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.
  4. 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.
  5. Sam Ganzfried & Max Chiswick, 2019. "Most Important Fundamental Rule of Poker Strategy," Papers 1906.09895, arXiv.org, revised Feb 2020.
  6. Srihari Govindan & Robert Wilson, 2008. "Metastable Equilibria," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 787-820, 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. Sam Ganzfried & Farzana Yusuf, 2017. "Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy," Games, MDPI, vol. 8(4), pages 1-13, November.
  9. Chi Jin & Qinghua Liu & Yuanhao Wang & Tiancheng Yu, 2024. "V-Learning—A Simple, Efficient, Decentralized Algorithm for Multiagent Reinforcement Learning," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2295-2322, November.
  10. 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.
  11. 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.
  12. Yiyin Cao & Chuangyin Dang, 2025. "A Characterization of Nash Equilibrium in Behavioral Strategies through Local Sequential Rationality," Papers 2504.00529, arXiv.org, revised Apr 2025.
  13. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
  14. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
  15. Srihari Govindan & Robert Wilson, 2012. "Axiomatic Equilibrium Selection for Generic Two‐Player Games," Econometrica, Econometric Society, vol. 80(4), pages 1639-1699, July.
  16. 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), CY Cergy-Paris University, ESSEC and CNRS.
  17. Paolo Zappalà & Amal Benhamiche & Matthieu Chardy & Francesco De Pellegrini & Rosa Figueiredo, 2025. "Analysis and Computation of the Outcomes of Pure Nash Equilibria in Two-Player Extensive-Form Games," Dynamic Games and Applications, Springer, vol. 15(3), pages 872-905, July.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. Yiyin Cao & Chuangyin Dang, 2025. "A Characterization of Reny's Weakly Sequentially Rational Equilibrium through $\varepsilon$-Perfect $\gamma$-Weakly Sequentially Rational Equilibrium," Papers 2505.19496, arXiv.org.
  23. Sam Ganzfried & Austin Nowak & Joannier Pinales, 2018. "Successful Nash Equilibrium Agent for a 3-Player Imperfect-Information Game," Papers 1804.04789, arXiv.org.
  24. 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.
  25. 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.
  26. Brian Hu Zhang & Gabriele Farina & Andrea Celli & Tuomas Sandholm, 2026. "Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 60-91, January.
  27. Yuqing Hou & Yiyin Cao & Chuangyin Dang & Yong Wang, 2025. "A sequence-form differentiable path-following method to compute Nash equilibria," Computational Optimization and Applications, Springer, vol. 92(1), pages 265-300, September.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.