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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alimonti, P.: New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. In: Bonuccelli, M.A., Crescenzi, P.P., Petreschi, R. (eds.) CIAC 1994. LNCS, vol. 778, pp. 40–53. Springer, Heidelberg (1994)
Battiti, R., Protasi, M.: Approximate Algorithms and Heuristics for MAX-SAT. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of combinatorial optimization, vol. 1, pp. 77–148. Kluwer Academic Publishers, Dordrecht (1998)
Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc. of FOCS 2004, pp. 295–304 (2004)
Bil ò, V.: On Satisfiability Games and the Power of Congestion Games. In: Proc. of AAIM 2007. LNCS, vol. 4508, pp. 231–240 (2007)
Christodoulou, G., Koutsoupias, E.: On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59–70. Springer, Heidelberg (2005)
Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of STOC 2005, pp. 67–73 (2005)
Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 345–357. Springer, Heidelberg (2004)
Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: Proc. of SODA 2002, pp. 413–420 (2002)
Devanur, N.R., Garg, N., Khandekar, R., Pandit, V., Saberi, A., Vazirani, V.V.: Price of Anarchy, Locality Gap, and a Network Service Provider Game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 1046–1055. Springer, Heidelberg (2005)
Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of STOC 2004, pp. 604–612 (2004)
Khanna, S., Motwani, R., Sudan, M., Vazirani, U.V.: On Syntactic versus Computational Views of Approximability. SIAM Journal on Computing 28(1), 164–191 (1998)
Koutsoupias, E., Papadimitriou, C.: Worst Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior 14, 124–143 (1996)
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. of STOC 2001, pp. 749–753 (2001)
Roughgarden, T., Tardos, É.: How bad is selfish routing? In: Proc. of FOCS 2000, pp. 93–102 (2000)
Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1), 65–67 (1973)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giannakos, A., Gourvès, L., Monnot, J., Paschos, V.T. (2007). On the Performance of Congestion Games for Optimum Satisfiability Problems. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)