Computing Normal Form Perfect Equilibria for Extensive Two-Person Games

Bernhard von Stengel, Antoon van den Elzen () and Adolphus Talman
Additional contact information
Antoon van den Elzen: Div. of Humanities and Social Sciences 227-88, California Institute of Technology, Pasadena, CA 91125, U.S.A.

Econometrica, 2002, vol. 70, issue 2, 693-715

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.

Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (31)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecm:emetrp:v:70:y:2002:i:2:p:693-715

Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues

Access Statistics for this article

Econometrica is currently edited by Guido Imbens

More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().