Folk Theorems with Bounded

نویسندگان

  • George J. Mailath
  • Wojciech Olszewski
چکیده

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure towards private monitoring (the case of almost-public monitoring), while strict equilibria in unbounded-recall strategies are typically not robust. We prove that the perfect-monitoring folk theorem continues to hold when attention is restricted to strategies with bounded recall and the equilibrium is essentially required to be strict. The general result uses calendar time in an integral way in the construction of the strategy profile. If the players’ action spaces are sufficiently rich, then the strategy profile can be chosen to be independent of calendar time. Either result can then be used to prove a folk theorem for repeated games with almost-perfect almost-public monitoring.

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

ثبت نام

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

منابع مشابه

George J . Mailath and Wojciech Olszewski “ Folk Theorems with Bounded Recall under ( Almost ) Perfect Monitoring ” Third Version PIER Working Paper 10 - 007

We prove the perfect-monitoring folk theorem continues to hold when attention is restricted to strategies with bounded recall and the equilibrium is essentially required to be strict. As a consequence, the perfect monitoring folk theorem is shown to be behaviorally robust under almost-perfect almost-public monitoring. That is, the same specification of behavior continues to be an equilibrium wh...

متن کامل

Folk Theorems with Bounded Recall

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure towards private monitoring (the case of...

متن کامل

Folk theorems with bounded recall under (almost) perfect monitoring

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure towards private monitoring (the case of...

متن کامل

Sandwich-type theorems for a class of integral operators with special properties

In the present paper, we prove subordination, superordination and sandwich-type properties of a certain integral operators for univalent functions on open unit disc, moreover the special behavior of this class is investigated.

متن کامل

Two Folk Manipulability Theorems in the General One-to-one Two-sided Matching Markets with Money

We prove a “General Manipulability Theorem” for general one-to-one two-sided matching markets with money. This theorem implies two folk theorems, the Manipulability Theorem and the General Impossibility Theorem, and provides a sort of converse of the Non-Manipulability Theorem (Demange, 1982, Leonard, 1983, Demange and Gale, 1985).

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

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