2000 character limit reached
Smooth Fictitious Play in $N\times 2$ Potential Games
Published 30 Nov 2019 in cs.GT | (1912.00251v1)
Abstract: The paper shows that smooth fictitious play converges to a neighborhood of a pure-strategy Nash equilibrium with probability 1 in almost all $N\times 2$ ($N$-player, two-action) potential games. The neighborhood of convergence may be made arbitrarily small by taking the smoothing parameter to zero. Simple proof techniques are furnished by considering regular potential games.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.