{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:41:10Z","timestamp":1743097270273,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_25","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T03:22:50Z","timestamp":1311218570000},"page":"282-293","source":"Crossref","is-referenced-by-count":5,"title":["Social Context Congestion Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Celi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Flammini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasco","family":"Gallotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The Price of Stability for Network Design with Fair Cost Allocation. SIAM Journal of Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal of Computing"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-540-92185-1_73","volume-title":"Internet and Network Economics","author":"I. Ashlagi","year":"2008","unstructured":"Ashlagi, I., Krysta, P., Tennenholtz, M.: Social Context Games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 675\u2013683. Springer, Heidelberg (2008)"},{"key":"25_CR3","first-page":"57","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC)","author":"B. Awerbuch","year":"2005","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 57\u201366. ACM Press, New York (2005)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-16170-4_9","volume-title":"Algorithmic Game Theory","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Caragiannis, I., Fanelli, A., Monaco, G.: Improved lower bounds on the price of stability of undirected network design games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) Algorithmic Game Theory. LNCS, vol.\u00a06386, pp. 90\u2013101. Springer, Heidelberg (2010)"},{"key":"25_CR5","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical Congestion Games. Algorithmica (to appear)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.tcs.2009.10.007","volume":"411","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: When ignorance helps: Graphical multicast cost sharing games. Theoretical Computer Science\u00a0411(3), 660\u2013671 (2010)","journal-title":"Theoretical Computer Science"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight Bounds for Selfish and Greedy Load Balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-12450-1_8","volume-title":"Approximation and Online Algorithms","author":"G. Christodoulou","year":"2010","unstructured":"Christodoulou, G., Chung, C., Ligett, K., Pyrga, E., van Stee, R.: On the price of stability for undirected network design. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 86\u201397. Springer, Heidelberg (2010)"},{"key":"25_CR9","first-page":"67","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC)","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 67\u201373. ACM Press, New York (2005)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"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.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2006","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-10841-9_29","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2009","unstructured":"Fotakis, D., Gkatzelis, V., Kaporis, A.C., Spirakis, P.G.: The Impact of Social Ignorance on Weighted Congestion Games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 316\u2013327. Springer, Heidelberg (2009)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/11786986_50","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.G.: Atomic Congestion Games among Coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 572\u2013583. Springer, Heidelberg (2006)"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"91130","DOI":"10.1007\/s00224-007-9015-8","volume":"42","author":"M. Gairing","year":"2008","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. Theory of Computing Systems\u00a042, 91130 (2008)","journal-title":"Theory of Computing Systems"},{"key":"25_CR15","first-page":"89","volume-title":"Proceedings of the 38th ACM Symposium on Theory of Computing (STOC)","author":"A. Hayrapetyan","year":"2006","unstructured":"Hayrapetyan, A., Tardos, E., Wexler, T.: The Effect of Collusion in Congestion Games. In: Proceedings of the 38th ACM Symposium on Theory of Computing (STOC), pp. 89\u201398. ACM Press, New York (2006)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-72951-8_25","volume-title":"Structural Information and Communication Complexity","author":"G. Karakostas","year":"2007","unstructured":"Karakostas, G., Kim, T., Viglas, A., Xia, H.: Selfish Routing with Oblivious Users. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 318\u2013327. Springer, Heidelberg (2007)"},{"key":"25_CR17","first-page":"253","volume-title":"Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI)","author":"M.J. Kearns","year":"2001","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical Models for Game Theory. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI), pp. 253\u2013260. Morgan Kaufmann, San Francisco (2001)"},{"key":"25_CR18","first-page":"163","volume-title":"Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC)","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 163\u2013170. ACM Press, New York (2000)"},{"key":"25_CR19","first-page":"431","volume-title":"Proceedings of the 14th Advances in Neural Information Processing Systems (NIPS)","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J.: Small-world phenomena and the dynamics of information. In: Proceedings of the 14th Advances in Neural Information Processing Systems (NIPS), pp. 431\u2013438. MIT Press, Cambridge (2001)"},{"key":"25_CR20","first-page":"3","volume":"37","author":"J. Kleinberg","year":"2004","unstructured":"Kleinberg, J.: The Small-World Phenomenon and Decentralized Search. SIAM News\u00a037, 3 (2004)","journal-title":"SIAM News"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-74456-6_54","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E. Koutsoupias","year":"2007","unstructured":"Koutsoupias, E., Panagopoulou, P., Spirakis, P.G.: Selfish Load Balancing Under Partial Knowledge. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 609\u2013620. Springer, Heidelberg (2007)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"Active Networks","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Covaci, S. (ed.) IWAN 1999. LNCS, vol.\u00a01653, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"15","key":"25_CR23","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J. Li","year":"2009","unstructured":"Li, J.: An O(logn\/loglogn) upper bound on the price of stability for undirected Shapley network design games. Information Processing Letters\u00a0109(15), 876\u2013878 (2009)","journal-title":"Information Processing Letters"},{"key":"25_CR24","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 Behaviour\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behaviour"},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"25_CR26","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":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How Bad Is Selfish Routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"25_CR28","first-page":"31","volume-title":"Contributions to the theory of games","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: The value of n-person games. In: Contributions to the theory of games, pp. 31\u201340. Princeton University Press, Princeton (1953)"},{"issue":"1","key":"25_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., Tth, C.D., Zhou, Y.: Selfish Load Balancing and Atomic Congestion Games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:06:03Z","timestamp":1558296363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}