Nash Equilibrium and Learning Dynamics in Three-Player Matching $m$-Action Games
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915182518730752 |
|---|---|
| author | Fujimoto, Yuma Ariu, Kaito Abe, Kenshi |
| author_facet | Fujimoto, Yuma Ariu, Kaito Abe, Kenshi |
| contents | Learning in games discusses the processes where multiple players learn their optimal strategies through the repetition of game plays. The dynamics of learning between two players in zero-sum games, such as Matching Pennies, where their benefits are competitive, have already been well analyzed. However, it is still unexplored and challenging to analyze the dynamics of learning among three players. In this study, we formulate a minimalistic game where three players compete to match their actions with one another. Although interaction among three players diversifies and complicates the Nash equilibria, we fully analyze the equilibria. We also discuss the dynamics of learning based on some famous algorithms categorized into Follow the Regularized Leader. From both theoretical and experimental aspects, we characterize the dynamics by categorizing three-player interactions into three forces to synchronize their actions, switch their actions rotationally, and seek competition. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10825 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Nash Equilibrium and Learning Dynamics in Three-Player Matching $m$-Action Games Fujimoto, Yuma Ariu, Kaito Abe, Kenshi Computer Science and Game Theory Multiagent Systems Optimization and Control Chaotic Dynamics Learning in games discusses the processes where multiple players learn their optimal strategies through the repetition of game plays. The dynamics of learning between two players in zero-sum games, such as Matching Pennies, where their benefits are competitive, have already been well analyzed. However, it is still unexplored and challenging to analyze the dynamics of learning among three players. In this study, we formulate a minimalistic game where three players compete to match their actions with one another. Although interaction among three players diversifies and complicates the Nash equilibria, we fully analyze the equilibria. We also discuss the dynamics of learning based on some famous algorithms categorized into Follow the Regularized Leader. From both theoretical and experimental aspects, we characterize the dynamics by categorizing three-player interactions into three forces to synchronize their actions, switch their actions rotationally, and seek competition. |
| title | Nash Equilibrium and Learning Dynamics in Three-Player Matching $m$-Action Games |
| topic | Computer Science and Game Theory Multiagent Systems Optimization and Control Chaotic Dynamics |
| url | https://arxiv.org/abs/2402.10825 |