{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:17Z","timestamp":1759638077168},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_47","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:04:30Z","timestamp":1404554670000},"page":"547-558","source":"Crossref","is-referenced-by-count":3,"title":["On Linear Congestion Games with Altruistic Social Context"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"47_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S. Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact Price of Anarchy for Polynomial Congestion Games. SIAM Journal on Computing\u00a040(5), 1211\u20131233 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"47_CR2","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 on Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR3","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":"47_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings of STOC 2005, pp. 57\u201366. ACM Press (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2012.10.041","volume":"514","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V., Celi, A., Flammini, M., Gallotti, V.: Social Context Congestion Games. Theoretical Computer Science\u00a0514, 21\u201335 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"47_CR7","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I. Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica\u00a061(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"47_CR8","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":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-25510-6_33","volume-title":"Internet and Network Economics","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":"47_CR10","doi-asserted-by":"crossref","unstructured":"Chen, P.A., Kempe, D.: Altruism, Selfishness and Spite in Traffic Routing. In: Proceedings of EC 2008, pp. 140\u2013149. ACM Press (2008)","DOI":"10.1145\/1386790.1386816"},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-39212-2_44","volume-title":"Automata, Languages, and Programming","author":"G. Christodoulou","year":"2013","unstructured":"Christodoulou, G., Gairing, M.: Price of Stability in Polynomial Congestion Games. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 496\u2013507. Springer, Heidelberg (2013)"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proceedings of STOC 2005, pp. 67\u201373. ACM Press (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"47_CR13","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":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-41392-6_19","volume-title":"Algorithmic Game Theory","author":"A. Anagnostopoulos","year":"2013","unstructured":"Anagnostopoulos, A., Becchetti, L., de Keijzer, B., Sch\u00e4fer, G.: Inefficiency of Games with Social Context. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol.\u00a08146, pp. 219\u2013230. Springer, Heidelberg (2013)"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.G.: Atomic Congestion Games among Coalitions. ACM Transactions on Algorithms\u00a04(4) (2008)","DOI":"10.1145\/1383369.1383383"},{"key":"47_CR16","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":"47_CR17","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":"47_CR18","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, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"2","key":"47_CR19","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2008.06.045","volume":"406","author":"T. L\u00fccking","year":"2008","unstructured":"L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: A New Model for Selfish Routing. Theoretical Computer Science\u00a0406(2), 187\u2013206 (2008)","journal-title":"Theoretical Computer Science"},{"key":"47_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-45046-4_32","volume-title":"Web and Internet Economics","author":"M. Rahn","year":"2013","unstructured":"Rahn, M., Sch\u00e4fer, G.: Bounding the Inefficiency of Altruism through Social Contribution Games. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol.\u00a08289, pp. 391\u2013404. Springer, Heidelberg (2013)"},{"key":"47_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:31:14Z","timestamp":1558924274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}