On the complexity of repeated principal agent games

We examine an infinitely repeated principal agent game without discounting (Radner [1985]), in which the agent may engage in multiple projects. We focus on ''linear'' strategies that summarize each history into a linear function of public outcomes, and select an action according to a single threshold rule. We claim that linear strategies significantly simplify the computation needed to make strategic decisions following each history. Despite the simplicity of linear strategies, we can virtually recover the folk theorem. For any individually rational payoff vector in the interior of the set of feasible expected payoff vectors, there exists a pair of linear strategies that form a Nash equilibrium supporting the target payoff. The equilibrium strategies and the equilibrium payoff vectors form a globally stable solution (Smale [1980]).