Distributed Best Response Algorithms for Potential Games - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Distributed Best Response Algorithms for Potential Games

(1, 2) , (1) , (2)
1
2

Abstract

In this paper we design and analyze distributed algorithms to compute a Nash equilibrium in potential games. Our algorithms are based on best-response dynamics, with suitable revision sequences (orders of play). We compute the average complexity over all potential games of best response dynamics under a random i.i.d. revision sequence, since it can be implemented in a distributed way using Poisson clocks. We obtain a distributed algorithm whose execution time is within a constant factor of the optimal centralized one. We then show how to take advantage of the structure of the interactions between players in a network game: non-interacting players can play simultaneously. This improves best response algorithm, both in the centralized and in the distributed case.
Fichier principal
Vignette du fichier
ECC18-Durand-Garin-Gaujal.pdf (290.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01726836 , version 1 (08-03-2018)

Identifiers

  • HAL Id : hal-01726836 , version 1

Cite

Stéphane Durand, Federica Garin, Bruno Gaujal. Distributed Best Response Algorithms for Potential Games. ECC 2018 - 16th European Control Conference, Jun 2018, Limassol, Cyprus. pp.1-6. ⟨hal-01726836⟩
270 View
433 Download

Share

Gmail Facebook Twitter LinkedIn More