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

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

Nash' noncooperative and cooperative foundations for "bargaining with threats" are reinterpreted to achieve equilibrium selection in infinitely repeated two player games. The analysis is then extended to stochastic games, where players' choices affect the state transition matrix. Sufficient...

We study an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain over a unit surplus. Players who reach agreement are removed from the network without replacement. The global logic of efficient matchings and the local nature of bargaining, in...