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-step 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 equilibrium values. We explore the properties of these algorithms by applying them to familiar games, and find that the algorithm produces good approximations at moderate computational cost.