Abstract
We introduce and study a congestion game having MAX SAT as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for MAX SAT with locality gap 2/3. A similar congestion MIN SAT game is also studied. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Giannakos, A., Gourvès, L., Monnot, J., & Paschos, V. T. (2007). On the performance of congestion games for optimum satisfiability problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4858 LNCS, pp. 220–231). Springer Verlag. https://doi.org/10.1007/978-3-540-77105-0_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
