{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:00:50Z","timestamp":1762297250556},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_22","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:53:10Z","timestamp":1182775990000},"page":"231-240","source":"Crossref","is-referenced-by-count":7,"title":["On Satisfiability Games and the Power of Congestion Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"511","volume-title":"Proceedings of STOC 2003","author":"E. Anshelevich","year":"2003","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-Optimal Network Design with Selfish Agents. In: Proceedings of STOC 2003, pp. 511\u2013520. ACM Press, New York (2003)"},{"key":"22_CR2","first-page":"261","volume-title":"Proceedings of FOCS 2006","author":"X. Chen","year":"2006","unstructured":"Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash Equilibrium. In: Proceedings of FOCS 2006, pp. 261\u2013272. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination Mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11672142_28","volume-title":"STACS 2006","author":"G. Christodoulou","year":"2006","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and Approximation in Potential Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 349\u2013360. Springer, Heidelberg (2006)"},{"key":"22_CR5","first-page":"71","volume-title":"Proceedings of STOC 2006","author":"K. Daskalakis","year":"2006","unstructured":"Daskalakis, K., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. In: Proceedings of STOC 2006, pp. 71\u201378. ACM Press, New York (2006)"},{"key":"22_CR6","unstructured":"Daskalakis, K., Papadimitriou, C.H.: Three-Player Games Are Hard. Technical Report TR05-139, ECCC (2005)"},{"key":"22_CR7","first-page":"604","volume-title":"Proceedings of STOC 2004","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of STOC 2004, pp. 604\u2013612. ACM Press, New York (2004)"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1145\/210346.210415","volume":"42","author":"Y. Korilis","year":"1995","unstructured":"Korilis, Y., Lazar, A.: On the Existence of Equilibria in Non-cooperative Optimal Flow Control. Journal of the ACM\u00a042(3), 584\u2013613 (1995)","journal-title":"Journal of the ACM"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"La, R., Anantharam, V.: Optimal Routing Control: Game Theoretic Approach. In: Proceedings of the 1997 CDC Conference (1997)","DOI":"10.1109\/CDC.1997.657876"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion Games with Player Specific Payoff Functions. Games and Economic Behavior\u00a013, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"22_CR12","unstructured":"Mirrokni, V.S.: Approximation Algorithms for Distributed and Selfish Agents. Massachusetts Institute of Technology (June 2005)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-27821-4_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V.S. Mirrokni","year":"2004","unstructured":"Mirrokni, V.S., Vetta, A.: Convergence Issues in Competitive Games. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 183\u2013194. Springer, Heidelberg (2004)"},{"key":"22_CR14","unstructured":"Monderer, D.: Multipotential Games. In: Proceedings of IJCAI, to appear (2007)"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential Games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium Points in n-person Games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"22_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"6","key":"22_CR19","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1109\/90.477727","volume":"3","author":"S.J. Shenker","year":"1995","unstructured":"Shenker, S.J.: Making Greed Work in Networks: a Game-Theoretic Analysis of Switch Service Disciplines. IEEE\/ACM Transactions on Networking\u00a03(6), 819\u2013831 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:15Z","timestamp":1605762435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_22","relation":{},"subject":[]}}