Learning Equilibria in Coordination Games via Minorization-Maximization
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911699651526656 |
|---|---|
| author | S., Ashok Krishnan K. Cadre, Helene Le Busic, Ana |
| author_facet | S., Ashok Krishnan K. Cadre, Helene Le Busic, Ana |
| contents | This paper considers games where the utilities for agents are the sum of a term proportional to a social utility, and another term that is an individual cost or reward. The agents are assumed to be irrational in their perception of the individual cost or reward. The multi equilibrium game is regularized, and its strictly concave potential function is used to select a unique equilibrium. This selected equilibrium is shown to be an $ε-$equilibrium of the original game, where $ε$ is parametrized by the regularizing function. A minorization-maximization based iterative learning scheme is proposed to learn equilibria in this game. This scheme converges to the potential-optimal equilibrium, and has superior convergence behaviour in comparison to gradient and best response methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_13644 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Learning Equilibria in Coordination Games via Minorization-Maximization S., Ashok Krishnan K. Cadre, Helene Le Busic, Ana Computer Science and Game Theory This paper considers games where the utilities for agents are the sum of a term proportional to a social utility, and another term that is an individual cost or reward. The agents are assumed to be irrational in their perception of the individual cost or reward. The multi equilibrium game is regularized, and its strictly concave potential function is used to select a unique equilibrium. This selected equilibrium is shown to be an $ε-$equilibrium of the original game, where $ε$ is parametrized by the regularizing function. A minorization-maximization based iterative learning scheme is proposed to learn equilibria in this game. This scheme converges to the potential-optimal equilibrium, and has superior convergence behaviour in comparison to gradient and best response methods. |
| title | Learning Equilibria in Coordination Games via Minorization-Maximization |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2605.13644 |