We characterize belief-free equilibria in infinitely repeated games with incomplete information with N \ge 2 players and arbitrary information structures. This characterization involves a new type of individual rational constraint linking the lowest equilibrium payoffs across players. The...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We apply the average cost optimality equation to zero-sum Markov games, by considering a simple game with one-sided incomplete information that generalizes an example of Aumann and Maschler (1995). We determine the value and identify the optimal strategies for a range of parameters

We study a dynamic buyer-seller problem in which the good is information and there are no property rights. The potential buyer is reluctant to pay for information whose value to him is uncertain, but the seller cannot credibly convey its value to the buyer without disclosing the information...

This paper examines social learning when only one of the two types of decisions is observable. Because agents arrive randomly over time, and only those who invest are observed, later agents face a more complicated inference problem than in the standard model, as the absence of investment might...

We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The agent's actions are hidden, and the principal, who makes the offers, cannot commit to future actions. We identify the unique Markovian...

We provide tight bounds on the rate of convergence of the equilibrium payoff sets for repeated games under both perfect and imperfect public monitoring. The distance between the equilibrium payoff set and its limit vanishes at rate (1 - delta)^{1/2} under perfect monitoring, and at rate (1 -...

We investigate the role of market transparency in repeated first-price auctions. We consider a setting with independent private and persistent values. We analyze three distinct disclosure regimes regarding the bid and award history. In the minimal disclosure regime each bidder only learns...

We study a discrete-time model of repeated moral hazard without commitment. In every period, a principal finances a project, choosing the scale of the project and a contingent payment plan for an agent, who has the opportunity to appropriate the returns of a successful project unbeknownst the...

We analyze the optimal design of dynamic mechanisms in the absence of transfers. The designer uses future allocation decisions as a way of eliciting private information. Values evolve according to a two-state Markov chain. We solve for the optimal allocation rule, which admits a simple...