During Michaelmas Term, OxTalks will be moving to a new platform (full details are available on the Staff Gateway).
For now, continue using the current page and event submission process (freeze period dates to be advised).
If you have any questions, please contact halo@digital.ox.ac.uk
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.
