{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:45:26Z","timestamp":1725637526124},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255090"},{"type":"electronic","value":"9783642255106"}],"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-25510-6_33","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:51:09Z","timestamp":1322643069000},"page":"383-390","source":"Crossref","is-referenced-by-count":20,"title":["The Robust Price of Anarchy of Altruistic Games"],"prefix":"10.1007","author":[{"given":"Po-An","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[]},{"given":"David","family":"Kempe","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11944874_6","volume-title":"Internet and Network Economics","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: Pure Nash Equilibria in Player-Specific and Weighted Congestion Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 50\u201361. Springer, Heidelberg (2006)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc.\u00a045th Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Hajiaghayi, M.T., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Proc.\u00a040th Annual ACM Symposium on Theory of Computing, pp. 373\u2013382 (2008)","DOI":"10.1145\/1374376.1374430"},{"key":"33_CR4","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: Proc.\u00a05th Symposium on Trustworthy Global Computing (2010)","DOI":"10.1007\/978-3-642-15640-3_12"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chen, P.-A., David, M., Kempe, D.: Better vaccination strategies for better people. In: Proc.\u00a012th ACM Conference on Electronic Commerce (2010)","DOI":"10.1145\/1807342.1807370"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chen, P.-A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc.\u00a010th ACM Conference on Electronic Commerce, pp. 140\u2013149 (2008)","DOI":"10.1145\/1386790.1386816"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc.\u00a037th Annual ACM Symposium on Theory of Computing (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Altruism in atomic congestion games. In: Proc.\u00a017th European Symposium on Algorithms (2009)","DOI":"10.1007\/978-3-642-04128-0_16"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proc.\u00a016th Annual Symposium on Theoretical Aspects of Computer Science, March 4-6, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ledyard, J.: Public goods: A survey of experimental resesarch. In: Kagel, J., Roth, A. (eds.) Handbook of Experimental Economics, pp. 111\u2013194. Princeton University Press (1997)","DOI":"10.2307\/j.ctvzsmff5.6"},{"key":"33_CR11","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, 187\u2013206 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"33_CR12","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(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press (2005)","DOI":"10.21236\/ADA637949"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proc.\u00a041st Annual ACM Symposium on Theory of Computing, pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proc.\u00a043rd Symposium on Foundations of Computer Science (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25510-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T22:48:01Z","timestamp":1593298081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25510-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255090","9783642255106"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25510-6_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}