We introduce state-dependent smooth fictitious play and we use this learning algorithm to prove a Folk theorem for repeated potential games. Our result shows that decentralised learning algorithms can learn to collude through repeated interactions and without communication.
