Average complexity of the Best Response Algorithm in Potential Games

Stéphane Durand 1, 2 Bruno Gaujal 2
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
2 POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Computation of the expected number of steps and the expected number of move by the Best Response Algorithm in random potential game
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01396906
Contributor : Stephane Durand <>
Submitted on : Tuesday, November 15, 2016 - 10:59:07 AM
Last modification on : Friday, October 12, 2018 - 1:16:19 AM
Document(s) archivé(s) le : Thursday, March 16, 2017 - 5:27:45 PM

File

aep2016.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01396906, version 1

Citation

Stéphane Durand, Bruno Gaujal. Average complexity of the Best Response Algorithm in Potential Games . Atelier Evalution de Performance 2016, Mar 2016, Toulouse, France. ⟨hal-01396906⟩

Share

Metrics

Record views

356

Files downloads

113