Library Header Image
LSE Research Online LSE Library Services

Computationally efficient coordination in game trees

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.

Full text not available from this repository.


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:
Additional Information: © 2002 the authors
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Research centres and groups > Computational, Discrete and Applicable Mathematics@LSE (CDAM)
Date Deposited: 17 Dec 2008 16:08
Last Modified: 03 Sep 2021 23:05

Actions (login required)

View Item View Item