Advanced Search
MyIDEAS: Login to save this article or follow this journal

Computing Normal Form Perfect Equilibria for Extensive Two-Person Games

Contents:

Author Info

  • Bernhard von Stengel

    ()
    (Department of Mathematics, London School of Economics, Houghton St, London WC2A 2AE, United Kingdom)

  • Antoon van den Elzen

    ()
    (Div. of Humanities and Social Sciences 227-88, California Institute of Technology, Pasadena, CA 91125, U.S.A.)

  • Dolf Talman

    ()
    (Div. of Humanities and Social Sciences 227-88, California Institute of Technology, Pasadena, CA 91125, U.S.A.)

Abstract

This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector represents a pair of completely mixed strategies, then the equilibrium is normal form perfect. Computational experiments compare the sequence form and the reduced normal form, and show that only the sequence form is tractable for larger games. Copyright The Econometric Society 2002.

Download Info

If 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.
File URL: http://www.blackwellpublishing.com/ecta/asp/abstract.asp?iid=2&aid=300&vid=70
File Function: link to full text
Download Restriction: Access to full text is restricted to subscribers.

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 Info

Article provided by Econometric Society in its journal Econometrica.

Volume (Year): 70 (2002)
Issue (Month): 2 (March)
Pages: 693-715

as in new window
Handle: RePEc:ecm:emetrp:v:70:y:2002:i:2:p:693-715

Contact details of provider:
Phone: 1 212 998 3820
Fax: 1 212 995 4487
Email:
Web page: http://www.econometricsociety.org/
More information through EDIRC

Order Information:
Email:
Web: http://www.blackwellpublishing.com/memb.asp?ref=0012-9682

Related research

Keywords:

Other versions of this item:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. von Stengel, Bernhard, 1996. "Efficient Computation of Behavior Strategies," Games and Economic Behavior, Elsevier, vol. 14(2), pages 220-246, June.
  2. van den Elzen, Antoon & Talman, Dolf, 1999. "An Algorithmic Approach toward the Tracing Procedure for Bi-matrix Games," Games and Economic Behavior, Elsevier, vol. 28(1), pages 130-145, July.
  3. McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142 Elsevier.
  4. 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.
  5. Talman, A.J.J. & Elzen , A.H. van den, 1991. "A procedure for finding Nash equilibria in bi-matrix games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153117, Tilburg University.
  6. Kamiya, K. & Talman, D., 1990. "Linear Stationary Point Problems," Papers 9022, Tilburg - Center for Economic Research.
  7. Hans M. Amman & David A. Kendrick, . "Computational Economics," Online economics textbooks, SUNY-Oswego, Department of Economics, number comp1, Spring.
  8. 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.
  9. Wilson, Robert, 1992. "Computing Simply Stable Equilibria," Econometrica, Econometric Society, vol. 60(5), pages 1039-70, September.
  10. Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
  11. Koller, Daphne & Megiddo, Nimrod, 1996. "Finding Mixed Strategies with Small Supports in Extensive Form Games," International Journal of Game Theory, Springer, vol. 25(1), pages 73-92.
  12. Von Stengel, Bernhard, 2002. "Computing equilibria for two-person games," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 45, pages 1723-1759 Elsevier.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. 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.
  2. 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.
  3. Yukio KORIYAMA & Matias NUNEZ, 2014. "Hybrid Procedures," THEMA Working Papers 2014-02, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
  4. Federico Echenique, 2002. "Finding All Equilibria," Levine's Working Paper Archive 506439000000000059, David K. Levine.
  5. Herings, P. Jean-Jacques & Peeters, Ronald J. A. P., 2004. "Stationary equilibria in stochastic games: structure, selection, and computation," Journal of Economic Theory, Elsevier, vol. 118(1), pages 32-60, September.
  6. 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.
  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. 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.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:70:y:2002:i:2:p:693-715. 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: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).

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.