Algorithms for Finding Repeated Game Equilibria.

This paper describes computational techniques for finding all equilibria in infinitely repeated games with discounting and perfect monitoring. It illustrates these techniques with a three player Cournot game. This is the first infinitely repeated three player game ever solved. The paper also presents the solution for the set of equilibria in a two country tariff war. In both games the set of equilibria is large even when the players are not patient. Citation Copyright 1997 by Kluwer Academic Publishers.