Computational Folk theorem

maths

Statement

Lemma

For any 2-player discounted reward repeated game it is possible to build a Povlov-like machine with is Subgame perfect and can achieve Nash equilibrium in polynomial time. This is done in one of three ways

Proof