Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Caragiannis, Ioannis, Fanelli, Angelo, Gravin, Nick
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Artificial Intelligence Computational Complexity Computer Science Economics and Finance Humanities and Social Sciences
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!