This paper suggests a novel way to import the approach of axiomatic theories of individual choice into strategic settings and demonstrates the benefits of this approach. We propose both a tractable behavioral model as well as axioms applied to the behavior of the collection of players, focusing...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

This paper proposes simple axioms that characterize a generalization of backward induction. At any node of a decision tree, the decision maker looks forward a fixed number of stages perfectly. Beyond that, the decision maker aggregates continuation values according to a function that captures...

We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash...

We develop a dynamic framework of strategic information transmission through cheap talk in a social network. Privately informed agents have different preferences about the action to be implemented by each agent and repeatedly communicate with their neighbors in the network. We first characterize...

I present a model of observational learning with payoff interdependence. Agents, ordered in a sequence, receive private signals about an uncertain state of the world and sample previous actions. Unlike in standard models of observational learning, an agent's payoff depends both on the state and...

We study the role of communication in repeated games with private monitoring. We first show that without communication, the set of Nash equilibrium payoffs in such games is a subset of the set of ε-coarse correlated equilibrium payoffs (ε-CCE) of the underlying one-shot game. The value of ε...

We characterize a class of dynamic stochastic games that we call separable dynamic games with noisy transitions and establish that these widely used models are protocol invariant provided that periods are sufficiently short. Protocol invariance means that the set of Markov perfect equilibria is...

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