Sequential Equilibrium in Games of Imperfect Recall

نویسندگان

  • Joseph Y. Halpern
  • Rafael Pass
چکیده

Definitions of sequential equilibrium and perfect equilibrium are given in games of imperfect recall. Subtleties regarding the definition are discussed. JEL Classification numbers: C70, D81.

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

ثبت نام

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

منابع مشابه

Sequential Equilibrium and Perfect Equilibrium in Games of Imperfect Recall

Definitions of sequential equilibrium and perfect equilibrium are given in games of imperfect recall.

متن کامل

Sequential Equilibrium in Computational Games

We examine sequential equilibrium in the context of computational games [Halpern and Pass 2011a], where agents are charged for computation. In such games, an agent can rationally choose to forget, so issues of imperfect recall arise. In this setting, we consider two notions of sequential equilibrium. One is an ex ante notion, where a player chooses his strategy before the game starts and is com...

متن کامل

Equilibria in Finite Games with Imperfect Recall

We generalize traditional equilibrium concepts for finite games in extensive form with behavioral strategies so that they apply to all games, including games of imperfect recall. Adapting and augmenting previous definitions (in particular, by Piccione and Rubinstein, and by Battigalli), we define four notions: Distributed Agent Equilibrium (DAE), Distributed Nash Equilibrium (DNE), Distributed ...

متن کامل

Solving Imperfect Recall Games (Doctoral Consortium)

Imperfect recall games remain an unexplored part of the game theory, even though recent results in abstraction algorithms show that the imperfect recall might be the key to solving the immense games found in the real world efficiently. Our research objective is to develop the first algorithm capable of outperforming the state-of-the-art solvers applied directly to perfect recall games, by creat...

متن کامل

Counterfactual Regret Minimization in Sequential Security Games

Many real world security problems can be modelled as finite zero-sum games with structured sequential strategies and limited interactions between the players. An abstract class of games unifying these models are the normal-form games with sequential strategies (NFGSS). We show that all games from this class can be modelled as well-formed imperfect-recall extensiveform games and consequently can...

متن کامل

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


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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016