We analyze the social and private learning at the symmetric equilibria of a queueing game with strategic experimentation. An infinite sequence of agents arrive at a server which processes them at an unknown rate. The number of agents served at each date is either: a geometric random variable in...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

Some private-monitoring games, that is, games with no public histories, can have histories that are almost public. These games are the natural result of perturbing public monitoring games towards private monitoring. We explore the extent to which it is possible to coordinate continuation play in...

I prove an efficiency result for repeated games with imperfect public monitoring in which one player's utility is privately known and evolves according to a Markov process. Under certain assumptions, patient players can attain approximately efficient payoffs in equilibrium. The public signal...

We study impersonal exchange, and ask how agents can behave honestly in anonymous transactions without contracts. We analyze repeated anonymous random matching games, where agents observe only their own transactions. Little is known about cooperation in this setting beyond the prisoner's...

The paper discusses community enforcement in infinitely repeated, two-action games with local interaction and uncertain monitoring. Each player interacts with and observes only a fixed set of opponents, of whom he is privately informed. The main result shows that when beliefs about the...

Costly delay in negotiations can induce the negotiating parties to be more forthcoming with their information and improve the quality of the collective decision. Imposing a deadline may result in stalling, in which players at some point stop making concessions but switch back to conceding at the...

This paper extends the framework of Kajii and Morris (1997) to study the question of robustness to incomplete information in repeated games. We show that dynamically robust equilibria can be characterized using a one-shot robustness principle that extends the one-shot deviation principle. Using...

We study the repeated implementation of social choice functions in environments with complete information and changing preferences. We de?ne dynamic mono- tonicity, a natural but nontrivial dynamic extension of Maskin monotonicity, and show that it is necessary and almost suf?cient for repeated...

We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff...