We study a model where agents face a continuum of two-player games and categorize them into a finite number of situations to make sense of their complex environment. Each agent can cooperate or defect, conditional on the perceived category. Agents may not share the same categorization. The games...

The novelty of our model is to combine models of collective action on networks with models of social learning. Agents are connected according to an undirected graph, the social network, and have the choice between two actions: either to adopt a new behavior or technology or stay with the default...

We propose an extension to smooth fictitious play and prove that play converges to an ε-Markov perfect equilibrium with probability one in a class of stochastic games known as Markov potential games. We then prove a partial Folk theorem for repeated games under one-period perfect monitoring. We...

We study a hierarchical Bayesian persuasion game with a sender, a receiver, and several potential intermediaries, generalizing the framework of Kamenica and Gentzkow (2011). The sender must be persuasive through a hierarchy of intermediaries to reach the final receiver, whose action affects all...

This paper studies the interaction of beliefs, payoff parameters, and the cooperation rate in the infinitely repeated prisoner's dilemma. We show formally that a player's belief about the probability of cooperation by their opponent moderates the effect of changes in the payoff parameters on...

We revisit the classic model of two-player repeated games with undiscounted utility, observable actions, and one-sided incomplete information, and further assume the informed player has state-independent preferences. We show the informed player can attain a payoff in equilibrium if and only if...

This paper investigates the way in which adaptive players behave in the long run in finitely repeated games. Each player assigns subjective payoff assessments to his own actions and chooses the action which has the highest assessment at each of his information sets. After receiving payoffs,...

Decision-makers that choose information strategies instead of concrete actions elect stochastic choice rules that leave open the potential for errors, which can obfuscate the strategic interactions of players. This article establishes that dynamic, stochastic, games with rationally inattentive...

We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into convex categories. We give a full characterization of...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....