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

  • Ioannis Caragiannis
  • Angelo Fanelli
  • Nick Gravin
Conference paper

DOI: 10.1007/978-3-662-44803-8_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8768)
Cite this paper as:
Caragiannis I., Fanelli A., Gravin N. (2014) Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games. In: Lavi R. (eds) Algorithmic Game Theory. SAGT 2014. Lecture Notes in Computer Science, vol 8768. Springer, Berlin, Heidelberg

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Ioannis Caragiannis
    • 1
  • Angelo Fanelli
    • 2
  • Nick Gravin
    • 3
  1. 1.Computer Technology Institute “Diophantus” & Department of Computer Engineering and InformaticsUniversity of PatrasRionGreece
  2. 2.CNRS, Laboratoire CREM (UMR 6211)Université de Caen Basse-NormandieFrance
  3. 3.Microsoft ResearchCambridgeUSA

Personalised recommendations