Symmetric play in repeated allocation games

نویسندگان

  • Christoph Kuzmics
  • Thomas R. Palfrey
  • Brian W. Rogers
چکیده

We study symmetric play in a class of repeated games when players are patient. We show that, while the use of symmetric strategy profiles essentially does not restrict the set of feasible payoffs, the set of equilibrium payoffs is an interesting proper subset of the feasible and individually rational set. We also provide a theory of how rational individuals play these games, identifying particular strategies as focal through the considerations of Pareto optimality and simplicity. We report experiments that support many aspects of this theory.

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

ثبت نام

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

منابع مشابه

Symmetric Subgame Perfect Equilibria in Resource Allocation

We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N -agent, C-resource allocation problems, where the resources are all homogeneous. Bhaskar proposed one way to achieve this in 2-agent, 1resource games: Agents start by symmetrically randomizing their actions, and as soon as they each choose different actions, they start to f...

متن کامل

A review on symmetric games: theory, comparison and applications

Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...

متن کامل

Repeated Play of Families of Games by Resource-Constrained Players

This paper studies a repeated play of a family of games by resource-constrained players. To economize on reasoning resources, the family of games is partitioned into subsets of games which players do not distinguish. An example is constructed to show that when games are played a finite number of times, partitioning of the game set according to a coarse exogenously given partition might introduc...

متن کامل

Learning in and about Games

We study learning in finitely repeated 2× 2 normal form games, when players have incomplete information about their opponents’ payoffs. In a laboratory experiment we investigate whether players (a) learn the game they are playing, (b) learn to predict the behavior of their opponent, and (c) learn to play according to a Nash equilibrium of the repeated game. Our results show that the success in ...

متن کامل

Learning aspiration in repeated games

We study infinitely repeated symmetric 2×2 games played by bounded rational agents who follow a simple rule of thumb: each agent continues to play the same action if the current payoff exceeds the average of the past payoffs, and switches to the other action with a positive probability otherwise. By applying the stochastic approximation technique, we characterize the asymptotic outcomes for all...

متن کامل

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


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

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

دوره 154  شماره 

صفحات  -

تاریخ انتشار 2014