Computing Supergame Equilibria

We present a general method for computing the set of supergame equilibria in infinitely repeated games with perfect monitoring and public randomization. We present a three-stage algorithm which constructs a convex set containing the set of equilibrium values, constructs another convex set contained in the set of equilibrium values, and produces strategies which support them. We explore the properties of this algorithm by applying it to familiar games.