Is it possible to guarantee that the mere exposure of a subject to a belief elicitation task will not affect the very same beliefs that we are trying to elicit? In this paper, we introduce mechanisms that make it simultaneously strictly dominant for the subject (a) not to acquire any information...

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

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

We study the informed-principal problem in a bilateral asymmetric information trading setting with interdependent values and quasi-linear utilities. The informed seller proposes a mechanism and voluntarily certifies information about the good's characteristics. When the set of certifiable...

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

We define and analyze a "strategic topology'' on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...