Efficient Computation of Equilibria for Extensive Two-Person Games

Citations

Cited by:

1. 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.
2. 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.
3. 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.
4. Peter Miltersen & Troels Sørensen, 2010. "Computing a quasi-perfect equilibrium of a two-player game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 175-192, January.
5. 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.
   • Francoise Forges & Bernhard von Stengel, 2008. "Extensive form correlated equilibrium: definition and computational complexity," Post-Print hal-00360729, HAL.
6. Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications,, Elsevier.
7. P. Herings & Ronald Peeters, 2010. "Homotopy methods to compute equilibria in game theory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
   • Herings, P.J.J. & Peeters, R.J.A.P., 2006. "Homotopy methods to compute equilibria in game theory," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
8. repec:osf:socarx:h63mz_v1 is not listed on IDEAS
9. 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.
10. McDonald, Stuart & Wagner, Liam, "undated". "The Computation of Perfect and Proper Equilibrium for Finite Games via Simulated Annealing," Risk and Sustainable Management Group Working Papers 151191, University of Queensland, School of Economics.
    • Stuart McDonald & Liam Wagner, 2010. "The Computation of Perfect and Proper Equilibrium for Finite Games via Simulated Annealing," Risk & Uncertainty Working Papers WPR10_1, Risk and Sustainable Management Group, University of Queensland, revised Apr 2010.
11. Peter Godfrey-Smith & Manolo Martínez, 2013. "Communication and Common Interest," PLOS Computational Biology, Public Library of Science, vol. 9(11), pages 1-6, November.
12. 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.
    • Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
    • Sung, Shao Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Coalition Theory Network Working Papers 46655, Fondazione Eni Enrico Mattei (FEEM).
    • Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
13. Corine M. Laan & Ana Isabel Barros & Richard J. Boucherie & Herman Monsuur & Judith Timmer, 2019. "Solving partially observable agent‐intruder games with an application to border security problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(2), pages 174-190, March.
14. Pahl, Lucas, 2023. "Polytope-form games and index/degree theories for extensive-form games," Games and Economic Behavior, Elsevier, vol. 141(C), pages 444-471.
15. Aurélien Delage & Olivier Buffet & Jilles S. Dibangoye & Abdallah Saffidine, 2024. "HSVI Can Solve Zero-Sum Partially Observable Stochastic Games," Dynamic Games and Applications, Springer, vol. 14(4), pages 751-805, September.
16. Srihari Govindan & Robert Wilson, 2008. "Metastable Equilibria," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 787-820, November.
    • Srihari Govindan & Robert Wilson, 2006. "Metastable Equilibria," Levine's Bibliography 122247000000001211, UCLA Department of Economics.
    • Govindan, Srihari & Wilson, Robert B., 2007. "Metastable Equilibria," Research Papers 1934r, Stanford University, Graduate School of Business.
17. 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.
    • von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
    • von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 9f112346-b587-47f3-ad2e-6, Tilburg University, School of Economics and Management.
    • von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 4487e2bf-5bc1-47d3-819f-2, Tilburg University, School of Economics and Management.
18. Stuart McDonald & Liam Wagner, 2013. "A Stochastic Search Algorithm for the Computation of Perfect and Proper Equilibria," Discussion Papers Series 480, School of Economics, University of Queensland, Australia.
19. Shimoji, Makoto & Watson, Joel, 1998. "Conditional Dominance, Rationalizability, and Game Forms," Journal of Economic Theory, Elsevier, vol. 83(2), pages 161-195, December.
20. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
21. Theodore Turocy, 2010. "Computing sequential equilibria using agent quantal response equilibria," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 255-269, January.
22. 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.
23. Samid Hoda & Andrew Gilpin & Javier Peña & Tuomas Sandholm, 2010. "Smoothing Techniques for Computing Nash Equilibria of Sequential Games," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 494-512, May.
24. 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.
25. 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.
26. Benoit Duvocelle & János Flesch & Hui Min Shi & Dries Vermeulen, 2021. "Search for a moving target in a competitive environment," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 547-557, June.
    • Benoit Duvocelle & J'anos Flesch & Hui Min Shi & Dries Vermeulen, 2020. "Search for a moving target in a competitive environment," Papers 2008.09653, arXiv.org, revised Aug 2020.
27. Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
28. Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008. "Good neighbors are hard to find: computational complexity of network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
    • Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal & Savani Rahul, 2008. "Good neighbors are hard to find: computational complexity of network formation," Post-Print hal-00268851, HAL.
29. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
30. 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.