We consider an example of a Markov game with lack of information on one side, that was first introduced by Renault (2002). We compute both the value and optimal strategies for a range of parameter values.

We study an in.nitely-repeated .rst-price auction with common values. Initially, bid-ders receive independent private signals about the objects. value, which itself does not change over time. Learning occurs only through observation of the bids. Under one-sided incomplete information, this...

We study the relationship between a player’s (stage game) minmax payoff and the individually rational payoff in repeated games with imperfect monitoring. We characterize the signal structures under which these two payoffs coincide for any payoff matrix. Under a full rank assumption, we further...

We compare three common dispute resolution processes - negotiation, mediation, and arbitration - in the framework of Crawford and Sobel (1982). Under negotiation, the two parties engage in (possibly arbitrarily long) face-to-face cheap talk. Under mediation, the parties communicate with a...