Extensive-form correlated equilibrium: definition and computational complexity
von Stengel, B.
& Forges, F.
(2008).
Extensive-form correlated equilibrium: definition and computational complexity.
Mathematics of Operations Research,
33(4), 1002-1022.
https://doi.org/10.1287/moor.1080.0340
This paper defines the extensive-form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correlated equilibrium (CE). Before the game starts, a correlation device generates a move for each information set. This move is recommended to the player only when the player reaches the information set. In two-player perfect-recall extensive games without chance moves, the set of EFCE can be described by a polynomial number of consistency and incentive constraints. Assuming P is not equal to NP, this is not possible for the set of CE, or if the game has chance moves.
| Item Type | Article |
|---|---|
| Copyright holders | © 2008 INFORMS |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1287/moor.1080.0340 |
| Date Deposited | 18 Feb 2009 |
| URI | https://researchonline.lse.ac.uk/id/eprint/22840 |
Explore Further
- http://www.lse.ac.uk/Mathematics/people/Bernhard-Von-Stengel.aspx (Author)
- https://www.scopus.com/pages/publications/58849128865 (Scopus publication)
ORCID: https://orcid.org/0000-0002-3488-8322