Fiche du document
Auteur
Date
11 février 2020
Discipline
Type de document
Périmètre
Identifiant
- 2002.04734
Source
Collection
Organisation
Mots-clés
Computer Science - Computer Science and Game Theory Computer Science - Artificial Intelligence Computer Science - Multiagent Systems Economics - Theoretical Economics Mathematics - Optimization and ControlCiter ce document
Sam Ganzfried, « Fast Complete Algorithm for Multiplayer Nash Equilibrium », arXiv - économie
Partage / Export
Résumé
We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games, based on a quadratically-constrained feasibility program formulation. We demonstrate that the algorithm runs significantly faster than the prior fastest complete algorithm on several game classes previously studied and that its runtimes even outperform the best incomplete algorithms.