In many situations, such as trade in stock exchanges, agents have many instances to act even though the duration of interactions take a relatively short time. The agents in such situations can often coordinate their actions in advance, but coordination during the game consumes too much time. An...

We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable in the prisoner's dilemma. By contrast, when k 1 we...

In various environments new agents may base their decisions on observations of actions taken by a few other agents in the past. In this paper we analyze a broad class of such social learning processes, and study under what circumstances the initial behavior of the population has a lasting...

The hawk-dove game admits two types of equilibria: asymmetric pure equilibria in which players in one population play ‘hawk’ and players in the other population play ‘dove’, and a symmetric mixed equilibrium. The existing literature on dynamic evolutionary models show that populations...

We consider games in which players search for a hidden prize, and they have asymmetric information about the prize’s location. We study the social payoff in equilibria of these games. We present sufficient conditions for the existence of an equilibrium that yields the first-best payoff (i.e.,...

An equilibrium is communication-proof if it is unaffected by new opportunities to communicate and renegotiate. We characterize the set of equilibria of coordination games with pre-play communication in which players have private preferences over the feasible coordinated outcomes....