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

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

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.

Domains

Computer Science and Game Theory [cs.GT]
Fichier principal
Vignette du fichier
roadef.pdf (332.69 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-01396902

Submitted on : Tuesday, November 15, 2016-10:53:45 AM

Last modification on : Friday, September 6, 2024-10:12:41 AM

Long-term archiving on: Thursday, March 16, 2017-4:58:58 PM

Download

Dates and versions

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

Identifiers

  • HAL Id : hal-01396902 , version 1

Cite

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⟩

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
405 View
112 Download

Share

Gmail Mastodon Facebook X LinkedIn More