{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:37Z","timestamp":1725537457066},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_16","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"179-189","source":"Crossref","is-referenced-by-count":21,"title":["Altruism in Atomic Congestion Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM, 55(6) (2008)","DOI":"10.1145\/1455248.1455249"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-77105-0_47","volume-title":"Internet and Network Economics","author":"H. Ackermann","year":"2007","unstructured":"Ackermann, H., Skopalik, A.: On the Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 419\u2013430. Springer, Heidelberg (2007)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Kleinberg, R., Papadimitriou, C.: Congestion games with malicious players. In: Proc 8th Conference on Electronic Commerce (EC 2007), pp. 103\u2013112 (2007)","DOI":"10.1145\/1250910.1250926"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chen, P.-A., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc. 9th Conference on Electronic Commerce (EC 2008), pp. 140\u2013149 (2008)","DOI":"10.1145\/1386790.1386816"},{"issue":"1","key":"16_CR5","first-page":"157","volume":"88","author":"I. Eshel","year":"1998","unstructured":"Eshel, I., Samuelson, L., Shaked, A.: Altruists, egoists and hooligans in a local interaction model. American Economic Review\u00a088(1), 157\u2013179 (1998)","journal-title":"American Economic Review"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc 36th Symposium on Theory of Computing (STOC 2004), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1162\/003355399556151","volume":"114","author":"E. Fehr","year":"1999","unstructured":"Fehr, E., Schmidt, K.: A theory of fairness, competition, and cooperation. The Quarterly Journal of Economics\u00a0114, 817\u2013868 (1999)","journal-title":"The Quarterly Journal of Economics"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-93980-1_10","volume-title":"Approximation and Online Algorithms","author":"M. Gairing","year":"2009","unstructured":"Gairing, M.: Malicious bayesian congestion games. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 119\u2013132. Springer, Heidelberg (2009)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11786986_44","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (Un-) splittable flow in games with player-specific linear latency functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 501\u2013512. Springer, Heidelberg (2006)"},{"key":"16_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4771.001.0001","volume-title":"Moral Sentiments and Material Interests: The Foundations of Cooperation in Economic Life","author":"H. Gintis","year":"2005","unstructured":"Gintis, H., Bowles, S., Boyd, R., Fehr, E.: Moral Sentiments and Material Interests: The Foundations of Cooperation in Economic Life. MIT Press, Cambridge (2005)"},{"key":"16_CR11","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: Proc 20th Conf Artificial Intelligence (AAAI 2005), pp. 489\u2013494 (2005)"},{"key":"16_CR12","volume-title":"Encyclopedia of Algorithms","author":"A. Kaporis","year":"2008","unstructured":"Kaporis, A., Spirakis, P.: Stackelberg games: The price of optimum. In: Encyclopedia of Algorithms. Springer, Heidelberg (2008)"},{"issue":"8\u201310","key":"16_CR13","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.tcs.2008.11.002","volume":"410","author":"A. Kaporis","year":"2009","unstructured":"Kaporis, A., Spirakis, P.: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Theoretical Computer Science\u00a0410(8\u201310), 745\u2013755 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10107-006-0015-2","volume":"110","author":"G. Karakostas","year":"2007","unstructured":"Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. Mathematical Programming\u00a0110(3), 591\u2013613 (2007)","journal-title":"Mathematical Programming"},{"key":"16_CR15","first-page":"111","volume-title":"Handbook of Experimental Economics","author":"J. Ledyard","year":"1997","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, Princeton (1997)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1006\/redy.1998.0023","volume":"1","author":"D. Levine","year":"1998","unstructured":"Levine, D.: Modeling altruism and spitefulness in experiments. Review of Economic Dynamics\u00a01, 593\u2013622 (1998)","journal-title":"Review of Economic Dynamics"},{"issue":"1","key":"16_CR17","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":"16_CR18","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: Byzantine players in a virus inoculation game. In: Proc. 25th Symposium on Principles of Distributed Computing (PODC 2006), pp. 35\u201344 (2006)","DOI":"10.1145\/1146381.1146391"},{"volume-title":"Algorithmic Game Theory","year":"2007","key":"16_CR19","unstructured":"Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds.): Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"16_CR20","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. Intl. J. Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Intl. J. Game Theory"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C. Tovey","year":"1984","unstructured":"Tovey, C.: A simplified NP-complete satisfiability problem. Discrete Applied Mathematics\u00a08, 85\u201389 (1984)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:31:45Z","timestamp":1552141905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}