Smooth Fictitious Play in N × 2 Potential Games
| Autor: | H. Vincent Poor, Brian Swenson |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Computer Science::Computer Science and Game Theory
0209 industrial biotechnology Online learning Zero (complex analysis) 020206 networking & telecommunications 02 engineering and technology Fictitious play symbols.namesake 020901 industrial engineering & automation Simple (abstract algebra) Nash equilibrium Convergence (routing) 0202 electrical engineering electronic engineering information engineering symbols Applied mathematics Game theory Smoothing Mathematics |
| Zdroj: | ACSSC |
| Popis: | The paper shows that smooth fictitious play converges to a neighborhood of a pure-strategy Nash equilibrium with probability 1 in almost all N × 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|