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

A two-person infinite-horizon bargaining model where one of the players may have either of two discount factors, has a multiplicity of perfect Bayesian equilibria. Introducing the slightest possibility that either player may be one of a rich variety of stationary behavioral types singles out a...

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

We study the Markov perfect equilibria (MPEs) of an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain. Players who reach agreement are removed from the network without replacement. We establish the existence of MPEs and show that MPE payoffs...