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

Algorithmica, Volume 77, Issue 4, 2017, Pages 1143-1158.

Cited by: 9|Bibtex|Views13|Links
EI
Keywords:
Algorithmic game theoryComplexity of equilibriaPure Nash equilibriumPotential gamesConstraint satisfaction

Abstract:

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 ...More

Code:

Data:

Your rating :
0

 

Tags
Comments