On the computation of Nash equilibria in games on graphs
Résumé
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games played on graphs. I will present in particular a construction, called the suspect game construction, which allows to reduce the computation of Nash equilibria to the computation of winning strategies in a two-player zero-sum game.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|