Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We explore evolutionary dynamics for repeated games with small, but positive complexity costs. We begin by extending a folk theorem result by Cooper (1996) to continuation probabilities, or discount rates, smaller than 1. Then we show that All D has a uniform invasion barrier. Since none of the more cooperative equilibria are robust against indirect invasions, we might expect not to observe any cooperative equilibria when complexity costs are positive. The average level of cooperation in the dynamics, however, can hover anywhere between no cooperation at all, and the average level of cooperation in the absence of complexity costs, depending on how small complexity costs are and how large the population is.