Skip to Main content Skip to Navigation
Conference papers

Average complexity of the Best Response Algorithm in Potential Games

Stéphane Durand 1, 2 Bruno Gaujal 2
1 NECS - Networked Controlled Systems
GIPSA-DA - Département Automatique, Inria Grenoble - Rhône-Alpes
2 POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems
LIG - Laboratoire d'Informatique de Grenoble, Inria Grenoble - Rhône-Alpes
Abstract : 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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Stephane Durand <>
Submitted on : Tuesday, November 15, 2016 - 10:53:45 AM
Last modification on : Wednesday, May 13, 2020 - 4:16:01 PM
Document(s) archivé(s) le : Thursday, March 16, 2017 - 4:58:58 PM


Files produced by the author(s)


  • HAL Id : hal-01396902, version 1


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



Record views


Files downloads