{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:38Z","timestamp":1725538718911},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_24","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"263-274","source":"Crossref","is-referenced-by-count":0,"title":["Doing Good with Spam Is Hard"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Olbrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Skopalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Kleinberg, R., Papadimitriou, C.: Congestion games with malicious players. In: Proc. 8th EC, pp. 103\u2013112 (2007)","DOI":"10.1145\/1250910.1250926"},{"key":"24_CR2","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BF01918335","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-92185-1_31","volume-title":"Internet and Network Economics","author":"V. Bonifaci","year":"2008","unstructured":"Bonifaci, V., Harks, T., Sch\u00e4fer, G.: Stackelberg routing in arbitrary networks. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 239\u2013250. Springer, Heidelberg (2008)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Chen, P., Kempe, D.: Altruism, selfishness, and spite in traffic routing. In: Proc. 9th EC, pp. 140\u2013149 (2008)","DOI":"10.1145\/1386790.1386816"},{"issue":"6","key":"24_CR6","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/90.266050","volume":"1","author":"R. Cocchi","year":"1993","unstructured":"Cocchi, R., Shenker, S., Estrin, D., Zhang, L.: Pricing in computer networks: motivation, formulation, and example. IEEE\/ACM Transactions on Networking\u00a01(6), 614\u2013627 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th EC, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing edges for heterogeneous selfish users. In: Proc. 35th STOC, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"issue":"2","key":"24_CR9","first-page":"91","volume":"73","author":"S. Dafermos","year":"1969","unstructured":"Dafermos, S., Sparrow, F.T.: The Traffic Assignment Problem for a General Network. J. Research National Bureau of Standards, Series B\u00a073(2), 91\u2013118 (1969)","journal-title":"J. Research National Bureau of Standards, Series B"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2005.09.014","volume":"348","author":"L. Fleischer","year":"2005","unstructured":"Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theoretical Computer Science\u00a0348, 217\u2013225 (2005)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Taxes for heterogeneous selfish users in a multicommodity network. In: Proc. 45th FOCS, pp. 277\u2013285 (2004)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The Directed Subgraph Homeomorphism Problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Kaporis, A.C., Spirakis, P.G.: The price of optimum in stackelberg games on arbitrary single commodity networks and latency function. In: Proc. 18th SPAA (2006)","DOI":"10.1145\/1148109.1148113"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Edge pricing of multicommodity networks for heterogeneous selfish users. In: Proc. 45th FOCS, pp. 268\u2013276 (2004)","DOI":"10.1109\/FOCS.2004.26"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Kolliopoulos, S.G.: Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica (to appear) (2008)","DOI":"10.1007\/s00453-007-9018-5"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/90.554730","volume":"5","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE\/ACM Transactions on Networking\u00a05(1), 161\u2013173 (1997)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/9.557575","volume":"42","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Capacity allocation under noncooperative routing. IEEE Transactions on Automatic Control\u00a042, 309\u2013325 (1997)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-Case Equilibria. In: Proc. 16th STACS, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/3-540-45465-9_66","volume-title":"Automata, Languages and Programming","author":"V.S.A. Kumar","year":"2002","unstructured":"Kumar, V.S.A., Marathe, A.: Improved results for Stackelberg scheduling strategies. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, p. 776. Springer, Heidelberg (2002)"},{"key":"24_CR20","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, Basingstoke (1920)"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-92185-1_20","volume-title":"Internet and Network Economics","author":"A. Roth","year":"2008","unstructured":"Roth, A.: The Price of Malice in Linear Congestion Games. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 118\u2013125. Springer, Heidelberg (2008)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. 33rd STOC, pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The Price of Anarchy is Independent of the Network Topology. In: Proc. 34th STOC, pp. 428\u2013437 (2002)","DOI":"10.1145\/509907.509971"},{"issue":"2","key":"24_CR24","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How Bad is Selfish Routing? J. ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"5","key":"24_CR25","first-page":"922","volume":"72","author":"T. Roughgarden","year":"2006","unstructured":"Roughgarden, T.: On the Severity of Braess\u2019s Paradox: Designing Networks for Selfish Users is Hard. JCSS\u00a072(5), 922\u2013953 (2006)","journal-title":"JCSS"},{"key":"24_CR26","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Sharma, Y., Williamson, D.P.: Stackelberg thresholds in network routing games or the value of altruism. In: Proc. 8th EC, pp. 93\u2013102 (2007)","DOI":"10.1145\/1250910.1250925"},{"key":"24_CR28","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proc. 18th SODA, pp. 1133\u20131142 (2007)"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proc. of the Institute of Civil Engineers, Pt. II, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"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-04645-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:04Z","timestamp":1606185784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}