Average complexity of the Best Response Algorithm in Potential Games

Complexité moyenne de l'algorithme de meilleure réponse

Stéphane Durand (1, 2) , Bruno Gaujal (2)

1 NECS - Networked Controlled Systems
2 POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems

The best response algorithm is often used in game theory to find Nash equilibria, its worst case complexity is known.This article show the exact complexity of the best response algorithm in random potential games.

Mots clés: Average Complexity; Potential Games; Best Response

Domaines: Informatique et théorie des jeux [cs.GT]

Stéphane Durand, Bruno Gaujal. Average complexity of the Best Response Algorithm in Potential Games. ROADEF 2016 - 17ème conférence dela Société française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2016, Compiègne, France. ⟨hal-01396902⟩