{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T12:48:27Z","timestamp":1772714907331,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T00:00:00Z","timestamp":1423785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00224-014-9602-4","type":"journal-article","created":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T01:13:05Z","timestamp":1423703585000},"page":"782-804","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Inefficiency of Games with Social Context"],"prefix":"10.1007","volume":"57","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","published-online":{"date-parts":[[2015,2,13]]},"reference":[{"key":"9602_CR1","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Becchetti, L., de Keijzer, B., Sch\u00e4fer, G.: Inefficiency of games with social context. In: V\u00f6cking, B. (ed.) Proceedings of the 6th International Symposium on Algorithmic Game Theory, Lecture Notes in Computer Science, vol. 8146, pp. 219\u2013230. Springer (2013)","DOI":"10.1007\/978-3-642-41392-6_19"},{"key":"9602_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Krysta, P., Tennenholtz, M.: Social context games. In: Proceedings of the 4th International Workshop on Internet and Network Economics, pp. 675\u2013683 (2008)","DOI":"10.1007\/978-3-540-92185-1_73"},{"key":"9602_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"9602_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Celi, A., Flammini, M., Gallotti, V.: Social context congestion games. In: Proceedings of the 18th international conference on Structural Information and Communication Complexity, pp. 282\u2013293. Springer (2011)","DOI":"10.1007\/978-3-642-22212-2_25"},{"issue":"2","key":"9602_CR5","doi-asserted-by":"crossref","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 61(2), 274\u2013297 (2011)","journal-title":"Algorithmica"},{"key":"9602_CR6","unstructured":"Brandt, F., Sandholm, T., Shoham, Y.: Spiteful bidding in sealed-bid auctions. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 1207\u20131214 (2007)"},{"key":"9602_CR7","doi-asserted-by":"crossref","unstructured":"Buehler, R., Goldman, Z., Liben-Nowell, D., Pei, Y., Quadri, J., Sharp, A., Taggart, S., Wexler, T., Woods, K.: The price of civil society. In: Proceedings of the 7th International Workshop on Internet and Network Economics, pp. 375\u2013382 (2011)","DOI":"10.1007\/978-3-642-25510-6_32"},{"key":"9602_CR8","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 4051, pp. 311\u2013322. Springer (2006)","DOI":"10.1007\/11786986_28"},{"key":"9602_CR9","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On the efficiency of equilibria in generalized second price auctions. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 81\u201390 (2011)","DOI":"10.1145\/1993574.1993588"},{"key":"9602_CR10","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Papaioannou, E.: The impact of altruism on the efficiency of atomic congestion games. In: Proceedings of the 5th Symposium on Trustworthy Global Computing (2010)","DOI":"10.1007\/978-3-642-15640-3_12"},{"key":"9602_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Lucier, B., Leme, R.P., Tardos, \u00c9.: On the efficiency of equilibria in generalized second price auctions. CoRR 1201.6429 (2012)","DOI":"10.1145\/1993574.1993588"},{"key":"9602_CR12","doi-asserted-by":"crossref","unstructured":"Chen, P.A., de Keijzer, B., Kempe, D., Sch\u00e4fer, G.: The robust price of anarchy of altruistic games. In: Proceedings of the 7th International Workshop on Internet and Network Economics, pp. 383\u2013390 (2011)","DOI":"10.1007\/978-3-642-25510-6_33"},{"key":"9602_CR13","doi-asserted-by":"crossref","unstructured":"Chen, P.A., de Keijzer, B., Kempe, D., Sch\u00e4fer, G.: Altruism and its impact on the price of anarchy. ACM Transactions on Economics and Computation (2014, to appear)","DOI":"10.1145\/2597893"},{"key":"9602_CR14","doi-asserted-by":"crossref","unstructured":"Chen, P.A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 140\u2013149 (2008)","DOI":"10.1145\/1386790.1386816"},{"key":"9602_CR15","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of the 37th ACM Symposium on the Theory of Computing, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"9602_CR16","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 438, 13\u201327 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"9602_CR17","doi-asserted-by":"crossref","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Inner product spaces for minsum coordination mechanisms. In: Proceedings of the 43rd ACM Symposium on the Theory of Computing, pp. 539\u2013548 (2011)","DOI":"10.1145\/1993636.1993708"},{"issue":"5","key":"9602_CR18","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1002\/nav.21497","volume":"59","author":"JR Correa","year":"2012","unstructured":"Correa, J.R., Queyranne, M.: Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost. Nav. Res. Logist. 59(5), 384\u2013395 (2012)","journal-title":"Nav. Res. Logist."},{"key":"9602_CR19","unstructured":"de Keijzer, B.: Externalities and Cooperation in Algorithmic Game Theory. Ph.D. thesis, Centrum voor Wiskunde en Informatica (CWI) (2014)"},{"key":"9602_CR20","doi-asserted-by":"crossref","unstructured":"Elias, J., Martignon, F., Avrachenkov, K., Neglia, G.: Socially-aware network design games. In: Proceedings of the 29th Conference on Computer Communications, pp. 41\u201345 (2010)","DOI":"10.1109\/INFCOM.2010.5462275"},{"key":"9602_CR21","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. 1, chap. 8, pp. 615\u2013691. Elsevier (2006)","DOI":"10.1016\/S1574-0714(06)01008-6"},{"key":"9602_CR22","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Gkatzelis, V., Kaporis, A.C., Spirakis, P.: The impact of social ignorance on weighted congestion games. In: Proceedings of the 5th International Workshop on Internet and Network Economics, pp. 316\u2013327. Springer (2009)","DOI":"10.1007\/978-3-642-10841-9_29"},{"issue":"4","key":"9602_CR23","first-page":"21","volume":"1","author":"M Hoefer","year":"2009","unstructured":"Hoefer, M., Skopalik, A.: Altruism in atomic congestion games. Trans. Econ. Comput. 1(4), 21 (2009)","journal-title":"Trans. Econ. Comput."},{"key":"9602_CR24","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Stability and convergence in selfish scheduling with altruistic agents. In: Proceedings of the 5th International Workshop on Internet and Network Economics, pp. 616\u2013622 (2009)","DOI":"10.1007\/978-3-642-10841-9_63"},{"key":"9602_CR25","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Social context in potential games. In: Proceedings of the 8th International Conference on Internet and Network Economics, pp. 364\u2013377 (2012)","DOI":"10.1007\/978-3-642-35311-6_27"},{"key":"9602_CR26","doi-asserted-by":"crossref","unstructured":"Hoeksma, R., Uetz, M.: The price of anarchy for minsum related machine scheduling. In: Proceedings of the 9th International Conference on Approximation and Online Algorithms, 261\u2013273 (2012)","DOI":"10.1007\/978-3-642-29116-6_22"},{"key":"9602_CR27","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"9602_CR28","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Tardos, \u00c9.: Pure and bayes-nash price of anarchy for generalized second price auction. In: 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 735\u2013744 (2010)","DOI":"10.1109\/FOCS.2010.75"},{"key":"9602_CR29","doi-asserted-by":"crossref","unstructured":"Lucier, B., Leme, R.P.: GSP auctions with correlated types. In: Proceedings 12th ACM Conference on Electronic Commerce (EC), pp. 71\u201380 (2011)","DOI":"10.1145\/1993574.1993587"},{"key":"9602_CR30","doi-asserted-by":"crossref","unstructured":"Rahn, M., Sch\u00e4fer, G.: Bounding the inefficiency of altruism through social contribution games. In: Chen, Y., Immorlica, N. (eds.) Proceedings of the 9th International Conference on Web and Internet Economics (WINE), Lecture Notes in Computer Science, Vol. 8289, pp. 391\u2013404. Springer (2013)","DOI":"10.1007\/978-3-642-45046-4_32"},{"key":"9602_CR31","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 862\u2013879 (2012)","DOI":"10.1145\/2229012.2229078"},{"key":"9602_CR32","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schoppmann, F.: Local smoothness and the price of anarchy in atomic splittable congestion games. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, pp. 255\u2013267 (2011)","DOI":"10.1137\/1.9781611973082.22"},{"issue":"7","key":"9602_CR33","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/2209249.2209274","volume":"55","author":"T Roughgarden","year":"2012","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. Commun. ACM 55(7), 116\u2013123 (2012). (Preliminary version appeared in STOC 2009.)","journal-title":"Commun. ACM"},{"key":"9602_CR34","doi-asserted-by":"crossref","unstructured":"Suri, S., T\u00f3th, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 188\u2013195. ACM (2004)","DOI":"10.1145\/1007912.1007941"},{"key":"9602_CR35","unstructured":"Syrgkanis, V.: Bayesian games and the smoothness framework. CoRR 1203.5155 (2012)"},{"key":"9602_CR36","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms. In: Proceedings of the 45th ACM Symposium on the Theory of Computing (2013)","DOI":"10.1145\/2488608.2488635"},{"key":"9602_CR37","unstructured":"Young, H.P., Strategic Learning and its Limits. Oxford University Press (1995)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9602-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9602-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9602-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T17:41:09Z","timestamp":1566322869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9602-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,13]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9602"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9602-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,13]]}}}