Extensive-Form Correlated Equilibrium: Definition and Computational Complexity

نویسندگان

  • Bernhard von Stengel
  • Françoise Forges
چکیده

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 polynomial number of consistency and incentive constraints. Assuming P 6= NP, this is not possible for the set of CE, or if the game has chance moves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational complexity of correlated equilibria for extensive games

Correlated equilibria are more general than Nash equilibria. For games in strategic form, they are also easier to compute. This no longer holds when the game is given in extensive form. We show that for an extensive twoplayer game with perfect recall, even without chance moves, it is computationally difficult (NP-hard) to find a correlated equilibrium with maximum payoff sum. Even with a modifi...

متن کامل

Computing a self-confirming equilibrium in two-player extensive-form games

The Nash equilibrium is the most commonly adopted solution concept for non–cooperative interaction situations. However, it underlays on the assumption of common information that is hardly verified in many practical situations. When information is not common, the appropriate game theoretic solution concept is the self–confirming equilibrium. It requires that every agent plays the best response t...

متن کامل

Computing Normal Form Perfect Equilibria for Extensive Two-person Games

This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...

متن کامل

Computing an Extensive-Form Perfect Equilibrium in Two-Player Games

Equilibrium computation in games is currently considered one of the most challenging issues in AI. In this paper, we provide, to the best of our knowledge, the first algorithm to compute a Selten’s extensive–form perfect equilibrium (EFPE) with two–player games. EFPE refines the Nash equilibrium requiring the equilibrium to be robust to slight perturbations of both players’ behavioral strategie...

متن کامل

Equilibrium Computation for Extensive Games

This thesis studies equilibrium computation algorithms for extensive games. We focus on the enumeration of Nash equilibria and on the computation of an extensive form correlated equilibrium. The contribution of this thesis consists of two parts. First, we study an algorithm for enumerating all Nash equilibria of a two-player extensive game. This algorithm is based on the sequence form descripti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2008