Average complexity of the Best Response Algorithm in Potential Games - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Average complexity of the Best Response Algorithm in Potential Games

Abstract

Computation of the expected number of steps and the expected number of move by the Best Response Algorithm in random potential game

Domains

Computer Science and Game Theory [cs.GT]
Fichier principal
Vignette du fichier
aep2016.pdf (143.17 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Stephane Durand  : Connect in order to contact the contributor

https://hal.science/hal-01396906

Submitted on : Tuesday, November 15, 2016-10:59:07 AM

Last modification on : Thursday, April 4, 2024-9:32:13 PM

Long-term archiving on: Thursday, March 16, 2017-5:27:45 PM

Download

Dates and versions

hal-01396906 , version 1 (15-11-2016)

Identifiers

  • HAL Id : hal-01396906 , version 1

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA CNRS INRIA GIPSA GIPSA-DA LIG GIPSA-NECS LIG_SRCPR PERSYVAL-LAB INRIA2 LIG-SRCPR-POLARIS ANR LIG_SIDCH
232 View
83 Download

Share

Gmail Mastodon Facebook X LinkedIn More