The complexity of two-person zero-sum games in extensive form
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 4 (1992)
Issue (Month): 4 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer, vol. 42(1), pages 1-7, January.
- Srihari Govindan & Robert Wilson, 2012.
"Axiomatic Equilibrium Selection for Generic Two‐Player Games,"
Econometric Society, vol. 80(4), pages 1639-1699, 07.
- Srihari Govindan & Robert Wilson, 2010. "Axiomatic Equilibrium Selection For Generic Two-Player Games," Levine's Working Paper Archive 661465000000000203, David K. Levine.
- Srihari Govindan & Robert Wilson, 2009. "Axiomatic Equilibrium Selection for Generic two-player games," Levine's Working Paper Archive 814577000000000231, David K. Levine.
- Govindan, Srihari & Wilson, Robert, 2009. "Axiomatic Equilibrium Selection for Generic Two-Player Games," Research Papers 2021, Stanford University, Graduate School of Business.
- 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.
- Stengel, B. von & Elzen, A.H. van den & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, Faculty of Economics and Business Administration.
- Stengel, B. von & Elzen, A.H. van den & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-88290, Tilburg University.
- Demuynck, Thomas, 2011.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Open Access publications from Katholieke Universiteit Leuven
urn:hdl:123456789/310965, Katholieke Universiteit Leuven.
- Thomas DEMUYNCK, 2011. "The computational complexity of rationalizing Pareto optimal choice behavior," Center for Economic Studies - Discussion papers ces11.13, Katholieke Universiteit Leuven, Centrum voor Economische Studiën.
- Govindan, Srihari & Wilson, Robert B., 2007. "Stable Outcomes of Generic Games in Extensive Form," Research Papers 1933r, Stanford University, Graduate School of Business.
- 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.
- Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer, vol. 42(1), pages 193-236, January.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- 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.
- von Stengel, Bernhard & Koller, Daphne, 1997. "Team-Maxmin Equilibria," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 309-321, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.