Forges, Francoise and von Stengel, Bernhard 
ORCID: 0000-0002-3488-8322
(2002)
Computationally efficient coordination in game trees.
CDAM research report series (LSE-CDAM-2002-02).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.
Abstract
The solution concept of “correlated equilibrium” allows for coordination in games. For game trees with imperfect information, it gives rise to NP-hard problems, even for two-player games without chance moves. We introduce the “extensive form correlated equilibrium” (EFCE), which extends Aumann’s correlated equilibrium, where coordination is achieved by signals that are received “locally” at information sets. An EFCE is polynomial-time computable for two-player games without chance moves.
| Item Type: | Monograph (Report) |
|---|---|
| Official URL: | http://www.cdam.lse.ac.uk |
| Additional Information: | © 2002 the authors |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 17 Dec 2008 16:08 |
| Last Modified: | 12 Dec 2024 05:39 |
| URI: | http://eprints.lse.ac.uk/id/eprint/13541 |
Actions (login required)
 |
View Item |
