Efficient Computation of Equilibria for Extensive Two-Person Games
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- 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.
- Papadimitriou, Christos, 2015. "The Complexity of Computing Equilibria," Handbook of Game Theory with Economic Applications, Elsevier.
- 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.
- McDonald, Stuart & Wagner, Liam, 2010. "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.
- 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.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002.
"Computing Normal Form Perfect Equilibria for Extensive Two-Person Games,"
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.
- 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.
- Shimoji, Makoto & Watson, Joel, 1998. "Conditional Dominance, Rationalizability, and Game Forms," Journal of Economic Theory, Elsevier, vol. 83(2), pages 161-195, December.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- 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.
- Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
- P. Herings & Ronald Peeters, 2010.
"Homotopy methods to compute equilibria in game theory,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
- Herings P. Jean-Jacques & Peeters Ronald, 2006. "Homotopy Methods to Compute Equilibria in Game Theory," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- 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.
- 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.
- 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.
More about this item
StatisticsAccess 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:14:y:1996:i:2:p:247-259. 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: http://www.elsevier.com/locate/inca/622836 .
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.