Extensive-Form Correlated Equilibrium: Definition and Computational Complexity

Extensive-Form Correlated Equilibrium: Definition and Computational Complexity

0.00 Avg rating0 Votes
Article ID: iaor200954201
Country: United States
Volume: 33
Issue: 4
Start Page Number: 1002
End Page Number: 1022
Publication Date: Nov 2008
Journal: Mathematics of Operations Research
Authors: ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.