Case studies of cartels and recent theory suggest that repeated communication is key for stable cooperation in environments where signals about others' actions are noisy. However, empirically the exact role of communication is not well understood. We study cooperation under different monitoring...

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...

We analyze a game in which players with unique information are arranged in a hierarchy. In the lowest layer each player can decide in each of several rounds either to pass the information to his successor or to hold. While passing generates an immediate payoff according to the value of...

A continuum of agents play an incomplete information game with continuous action. An agent's best-response function is linear on his expectation of a common payoff shock and the average action taken by the other agents. The interaction parameter is the weight that an agent places on the actions...

We study investment and consumption decisions in a dynamic game under learning. To that end, we present a model in which agents not only extract a resource for consumption, but also invest in technology to improve the future stock. At the same time, the agents learn about the stochastic process...

We analyze games of incomplete information and offer equilibrium predictions which are valid for, and in this sense robust to, all possible private information structures that the agents may have. We completely characterize the set of Bayes correlated equilibria in a class of games with...

We analyze games of incomplete information and offer equilibrium predictions which are valid for all possible private information structures that the agents may have. Our characterization of these robust predictions relies on an epistemic result which establishes a relationship between the set...

Game theorists typically assume that changing a game's payoff levels - by adding the same constant to, or subtracting it from, all payoffs - should not affect behavior. While this invariance is an implication of the theory when payoffs mirror expected utilities, it is an empirical question when...

We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of...

We introduce the algorithmic learning equations (ALEs), a set of ordinary differential equations which characterizes the finite-time and asymptotic behaviour of the stochastic interaction between state-dependent learning algorithms in dynamic games. Our framework allows for a variety of...