Centre for Discrete and Applicable Mathematics

 CDAM Research Report, LSE-CDAM-2002-02

April 2002


Computationally Efficient Coordination in Game Trees

Françoise Forges and Bernhard von Stengel

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.


A PDF file (118 kB) with the full contents of this report can be downloaded by clicking here.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2002-02, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
Houghton Street
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7732.
Fax: +44(0)-20-7955 6877.
Email: info@maths.lse.ac.uk


Introduction to the CDAM Research Report Series.
CDAM Homepage.


Copyright © London School of Economics & Political Science 2005

Last changed: Wed 9 Feb 2005
For comments go to: http://www.maths.lse.ac.uk/webmaster.html