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

We build a linear-quadratic model to analyze trading in a market with private information and heterogeneous agents. Agents receive private taste/inventory shocks and trade continuously. Agents differ in their need for trade as well as the cost to hold excessive inventory. In equilibrium, trade...

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 study a class of continuous-time reputation games between a large player and a population of small players in which the actions of the large player are imperfectly observable. The large player is either a normal type, who behaves strategically, or a behavioral type, who is committed to...

We study the subgame perfect equilibria of two player stochastic games with perfect monitoring and geometric discounting. A novel algorithm is developed for calculating the discounted payoffs that can be attained in equilibrium. This algorithm generates a sequence of tuples of payoffs vectors,...

We study the pure-strategy subgame-perfect Nash equilibria of stochastic games with perfect monitoring, geometric discounting, and public randomization. Novel algorithms are developed for calculating the discounted payoffs that can be attained in equilibrium. We also provide implementations of...