English

Smooth Fictitious Play in $N\times 2$ Potential Games

Computer Science and Game Theory 2019-12-03 v1

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×2N\times 2 (NN-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.

Keywords

Cite

@article{arxiv.1912.00251,
  title  = {Smooth Fictitious Play in $N\times 2$ Potential Games},
  author = {Brian Swenson and H. Vincent Poor},
  journal= {arXiv preprint arXiv:1912.00251},
  year   = {2019}
}