Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2017

Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games

Résumé

We present an algorithm that computes approximate pure Nash equilibria in a broad class of constraint satisfaction games that generalize the well-known cut and party affiliation games. Our results improve previous ones by Bhalgat et al. (EC 10) in terms of the obtained approximation guarantee. More importantly, our algorithm identifies a polynomially-long sequence of improvement moves from any initial state to an approximate equilibrium in these games. The existence of such short sequences is an interesting structural property which, to the best of our knowledge, was not known before. Our techniques adapt and extend our previous work for congestion games (FOCS 11) but the current analysis is considerably simpler.

Dates et versions

hal-02089387 , version 1 (03-04-2019)

Identifiants

Citer

Ioannis Caragiannis, Angelo Fanelli, Nick Gravin. Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. Algorithmica, 2017, 77 (4), pp.1143-1158. ⟨10.1007/s00453-016-0143-x⟩. ⟨hal-02089387⟩
47 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More