Skip to content

The robustness of incomplete penal codes in repeated interactions

    Olivier Gossner
    CREST Working Paper, 2020

    Abstract: We study the robustness of equilibria with regards to small payoff perturbations of the dynamic game. We find that complete penal codes, that specify players’ strategies after every history, have only limited robustness. For some generic games, no complete codes exist that are robust to even arbitrarily small perturbations. We define incomplete penal codes as partial descriptions of equilibrium strategies and introduce a notion of robustness for incomplete penal codes. We prove a Folk Theorem in robust incomplete codes that generates a Folk Theorem in a class of stochastic games.