We consider a dynamic version of sender–receiver games, where the sequence of states follows an irreducible Markov chain observed by the sender. Under mild assumptions, we provide a simple characterization of the limit set of equilibrium payoffs, as players become very patient. Under these...

We study a class of symmetric strategic experimentation games. Each of two players faces an (exponential) two-armed bandit problem, and must decide when to stop experimenting with the risky arm. The equilibrium amount of experimentation depends on the degree to which experimentation outcomes are...

Experts are asked to provide their advice in a situation of uncertainty. They adopt the decision makerʼs utility function, but each has a potentially different set of prior probabilities, and so does the decision maker. The decision maker and the experts maximize the minimal expected utility...

This paper provides a dual characterization of the existing ones for the limit set of perfect public equilibrium payoffs in a class of finite stochastic games (in particular, repeated games) as the discount factor tends to one. As a first corollary, the folk theorems of Fudenberg et al. (1994),...

We analyze a toy class of two-player repeated games with two-sided incomplete information. In our model, two players are facing independent decision problems and each of them holds information that is potentially valuable to the other player. We study to what extent, and how, information can be...

We study a model in which each of finitely many agent cares about a given subset of finitely many goods. We provide minimal conditions that ensure the existence and uniqueness of the equilibrium price vector - a price vector for which supply meets demand. Copyright Springer-Verlag...

We study finite zero-sum stochastic games in which players do not observe the actions of their opponent. Rather, at each stage, each player observes a stochastic signal that may depend on the current state and on the pair of actions chosen by the players. We assume that each player observes the...

We provide a tight bound on the amount of experimentation under the optimal strategy in sequential decision problems. We show the applicability of the result by providing a bound on the cut-off in a one-arm bandit problem.