We analyze information design games between two designers with opposite preferences and a single agent. Before the agent makes a decision, designers repeatedly disclose public information about persistent state parameters. Disclosure continues until no designer wishes to reveal further...

This paper studies how the persistence of past choices can be used to create incentives in a continuous time stochastic game. A large player, such as a firm, interacts with a sequence of small players, such as customers. The large player faces moral hazard and her actions are imperfectly...

We study a model in which two players with opposing interests try to alter a status quo through instability-generating actions. We show that instability can be used to secure longer-term durable changes, even if it is costly to generate and does not generate short-term gains. In equilibrium,...

Harris, Reny, and Robson (1995) added a public randomization device to dynamic games with almost perfect information to ensure existence of subgame perfect equilibria (SPE). We show that when Nature's moves are atomless in the original game, public randomization does not enlarge the set of SPE...

This paper uses the framework of stochastic games to propose a model of emotions in repeated interactions. An emotional player can be in either a friendly, a neutral, or a hostile state of mind. The player transitions between the states of mind as a response to observed actions taken by the...

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

Abstract In this paper we give sufficient conditions for solving two-person zero sum stopping games. These are games where the strategy set of the two players are stopping times of a diffusion X . Our method is based on the study of harmonic functions for the diffusion and it is similar to the...

An absorbing game is a repeated game where some action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage. We prove that every multi-player absorbing...

This paper discusses the problem regarding the existence of optimal or nearly optimal stationary strategies for a player engaged in a nonleavable stochastic game. It is known that, for these games, player I need not have an -optimal stationary strategy even when the state space of the game is...