{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:55Z","timestamp":1759638115611},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413919"},{"type":"electronic","value":"9783642413926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41392-6_19","type":"book-chapter","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T23:30:26Z","timestamp":1381275026000},"page":"219-230","source":"Crossref","is-referenced-by-count":5,"title":["Inefficiency of Games with Social Context"],"prefix":"10.1007","author":[{"given":"Aris","family":"Anagnostopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Becchetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","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":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-22212-2_25","volume-title":"Structural Information and Communication Complexity","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Celi, A., Flammini, M., Gallotti, V.: Social context congestion games. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 282\u2013293. Springer, Heidelberg (2011)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00453-010-9417-x","volume":"61","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Moscardelli, L.: Graphical congestion games. Algorithmica\u00a061(2), 274\u2013297 (2011)","journal-title":"Algorithmica"},{"key":"19_CR4","unstructured":"Brandt, F., Sandholm, T., Shoham, Y.: Spiteful bidding in sealed-bid auctions. In: Proc. 20th Intl. Joint Conf. on Artifical Intelligence, pp. 1207\u20131214 (2007)"},{"key":"19_CR5","series-title":"LNCS","first-page":"375","volume-title":"WINE 2011","author":"R. Buehler","year":"2011","unstructured":"Buehler, R., et al.: The price of civil society. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol.\u00a07090, pp. 375\u2013382. Springer, Heidelberg (2011)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On the efficiency of equilibria in generalized second price auctions. In: Proc. 12th Conf. on Electronic Commerce, pp. 81\u201390 (2011)","DOI":"10.1145\/1993574.1993588"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-15640-3_12","volume-title":"Trustworthly Global Computing","author":"I. Caragiannis","year":"2010","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Papaioannou, E.: The impact of altruism on the efficiency of atomic congestion games. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010, LNCS, vol.\u00a06084, pp. 172\u2013188. Springer, Heidelberg (2010)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-642-25510-6_33","volume-title":"WINE 2011","author":"P.A. Chen","year":"2011","unstructured":"Chen, P.A., de Keijzer, B., Kempe, D., Sch\u00e4fer, G.: The robust price of anarchy of altruistic games. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol.\u00a07090, pp. 383\u2013390. Springer, Heidelberg (2011)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Chen, P.A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc. 9th Conf. on Electronic Commerce, pp. 140\u2013149 (2008)","DOI":"10.1145\/1386790.1386816"},{"key":"19_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":"19_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th Symp. on the Theory of Computing, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.02.033","volume":"438","author":"G. Christodoulou","year":"2012","unstructured":"Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. Theoretical Computer Science\u00a0438, 13\u201327 (2012)","journal-title":"Theoretical Computer Science"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proc. 43rd Symp. on the Theory of Computing, pp. 539\u2013548 (2011)","DOI":"10.1145\/1993636.1993708"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Elias, J., Martignon, F., Avrachenkov, K., Neglia, G.: Socially-aware network design games. In: Proc. 29th Conf. on Computer Communications, pp. 41\u201345 (2010)","DOI":"10.1109\/INFCOM.2010.5462275"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Fehr, E., Schmidt, K.M.: The Economics of Fairness, Reciprocity and Altruism: Experimental Evidence and New Theories. Handbook on the Economics of Giving, Reciprocity and Altruism, vol.\u00a01, ch. 8, pp. 615\u2013691 (2006)","DOI":"10.1016\/S1574-0714(06)01008-6"},{"key":"19_CR16","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":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04128-0_16","volume-title":"Algorithms - ESA 2009","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M., Skopalik, A.: Altruism in atomic congestion games. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 179\u2013189. Springer, Heidelberg (2009)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-10841-9_63","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M., Skopalik, A.: Stability and convergence in selfish scheduling with altruistic agents. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 616\u2013622. Springer, Heidelberg (2009)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-35311-6_27","volume-title":"Internet and Network Economics","author":"M. Hoefer","year":"2012","unstructured":"Hoefer, M., Skopalik, A.: Social context in potential games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol.\u00a07695, pp. 364\u2013377. Springer, Heidelberg (2012)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-29116-6_22","volume-title":"Approximation and Online Algorithms","author":"R. Hoeksma","year":"2012","unstructured":"Hoeksma, R., Uetz, M.: The price of anarchy for minsum related machine scheduling. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol.\u00a07164, pp. 261\u2013273. Springer, Heidelberg (2012)"},{"key":"19_CR21","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.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 404. Springer, Heidelberg (1999)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc. 41st Symp. on the Theory of Computing, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proc. 13th Conf. on Electronic Commerce, pp. 862\u2013879 (2012)","DOI":"10.1145\/2229012.2229078"},{"key":"19_CR24","unstructured":"Syrgkanis, V.: Bayesian games and the smoothness framework. CoRR abs\/1203.5155 (2012)"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms. In: Proc. 45th Symp. on the Theory of Computing (2013)","DOI":"10.1145\/2488608.2488635"},{"key":"19_CR26","unstructured":"Young, H.P.: Strategic Learning and its Limits (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41392-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T10:52:24Z","timestamp":1564483944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41392-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413919","9783642413926"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41392-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}