Approximate robustness of equilibrium to incomplete information

نویسندگان

  • Ori Haimanko
  • Atsushi Kajii
چکیده

We relax the Kajii and Morris (1997a) notion of equilibrium robustness by allowing approximate equilibria in close incomplete information games. The new notion is termed “approximate robustness”. The approximately robust equilibrium correspondence turns out to be upper hemicontinuous, unlike the (exactly) robust equilibrium correspondence. As a corollary of the upper hemicontinuity, it is shown that approximately robust equilibria exist in all two-player zero-sum games and all two-player two-strategy games, whereas (exactly) robust equilibria may fail to exist for some games in these categories. JEL Classi…cation Number : C72.

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

ثبت نام

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

منابع مشابه

CARESS Working Paper # 95 - 18 The Robustness of Equilibria to Incomplete Information

A number of papers have shown that a strict Nash equilibrium action pro ̄le of a game may never be played if there is a small amount of incomplete information (see, for example, Carlsson and van Damme (1993a)). We present a general approach to analyzing the robustness of equilibria to a small amount of incomplete information. A Nash equilibrium of a complete information game is said to be robust...

متن کامل

Knightian games and robustness to ambiguity

This paper considers incomplete information games with ambiguous beliefs represented by compact sets of probability measures. We propose a definition of equilibrium for such games that does not rely on a max-min decision rule, but instead requires equilibrium strategies to be approximate best responses for all measures that define a player’s belief. We apply the resulting model of a game with a...

متن کامل

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibriu...

متن کامل

Robust Equilibria of Potential Games

Potential games are games with potential functions. Technically, the potential function defines a refinement concept. We provide justification for this refinement concept using the notion of robustness of equilibria. A Nash equilibrium of a complete information game is said to be robust if every incomplete information game where payoffs are almost always given by the complete information game h...

متن کامل

The Robustness of Incomplete Penal Codes in Repeated Interactions

We study the robustness of equilibria with regards to small payoff perturbations of the dynamic game. We find that complete penal codes, that specify player’s strategies after every history, can have at best limited robustness and may even fail to exist for some games. We define incomplete penal codes as partial descriptions of equilibrium strategies. We construct incomplete penal codes that ar...

متن کامل

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


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

عنوان ژورنال:
  • Int. J. Game Theory

دوره 45  شماره 

صفحات  -

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