We study a variant of the repeated Prisoner's Dilemma with uncertain horizon, in which each player chooses his foresight ability: that is, the timing in which he is informed about the realized length of the interaction. In addition, each player has an independent probability to observe the...

We study a continuous-time game of strategic experimentation in which the players try to assess the failure rate of some new equipment or technology. Breakdowns occur at the jump times of a Poisson process whose unknown intensity is either high or low. In marked contrast to existing models, we...

We characterize perfect public equilibrium payoffs in dynamic stochastic games, in the case where the length of the period shrinks, but players' rate of time discounting and the transition rate between states remain fixed. We present a meaningful definition of the feasible and individually...

This paper studies an infinite horizon repeated moral hazard problem where a single principal employs several agents. We assume that the principal cannot observe the agents' effort choices; however, agents can observe each other and can be contractually required to make observation reports to...

A key obstacle to coordination and cooperation in many networked environments is that behavior in each bilateral relationship is not observable to individuals outside that relationship: that is, information is local. This paper investigates when players can use communication to replicate any...

We consider a model of evolution in games in which a revising agent observes the actions of a random number of randomly sampled opponents and then chooses a best response to the distribution of actions in the sample. We provide a condition on the distribution of sample sizes under which an...

Abstract. We analyze discounted repeated games with incomplete information, such that the players' payoffs depend only on their own type (known-own payoff case). We describe an algorithm for finding all equilibrium payoffs in games for which there exists an open set of belief-free equilibria of...

We study repeated games with imperfect public monitoring and unequal discounting. We characterize the limit set of perfect and public equilibrium payoffs as discount factors converge to 1 with the relative patience between players …fixed. We show that the pairwise and individual full rank...

Consider repeated two-player games with perfect monitoring and discounting. We provide an algorithm that computes the set V* of payoff pairs of all pure-strategy subgame perfect equilibria with public randomization. The algorithm provides significant efficiency gains over the existing...

We prove a folk theorem for multiplayer games in continuous time when players observe a public signal distorted by Brownian noise. The proof is based on a rigorous foundation for such continuous-time multiplayer games. We study in detail the relation between behaviour and mixed strategies, and...