{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:08:07Z","timestamp":1764936487615},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921844"},{"type":"electronic","value":"9783540921851"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_35","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T11:44:33Z","timestamp":1228909473000},"page":"286-294","source":"Crossref","is-referenced-by-count":15,"title":["Taxing Subnetworks"],"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":"35_CR1","unstructured":"Beckmann, M., McGuire, C.B., Winston, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"35_CR2","first-page":"258","volume":"12","author":"D. Braess","year":"1968","unstructured":"Braess, D.: \u00dcber ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung\u00a012, 258\u2013268 (1968)","journal-title":"Unternehmensforschung"},{"issue":"6","key":"35_CR3","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":"35_CR4","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":"35_CR5","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":"35_CR6","first-page":"91","volume":"73","author":"S. Dafermos","year":"1969","unstructured":"Dafermos, S., Sparrow, F.T.: The Traffic Assignment Problem for a General Network. Journal of Research of the National Bureau of Standards, Series B\u00a073(2), 91\u2013118 (1969)","journal-title":"Journal of Research of the National Bureau of Standards, Series B"},{"key":"35_CR7","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":"35_CR8","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":"35_CR9","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":"35_CR10","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":"35_CR11","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":"35_CR12","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":"35_CR13","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":"35_CR14","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":"35_CR15","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (2002)"},{"key":"35_CR16","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, Basingstoke (1920)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proc. 33rd STOC, pp. 104\u2013113 (2001)","DOI":"10.1145\/380752.380783"},{"key":"35_CR18","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":"35_CR19","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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"5","key":"35_CR20","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1016\/j.jcss.2005.05.009","volume":"72","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T.: On the Severity of Braess\u2019s Paradox: Designing Networks for Selfish Users is Hard. Journal of Computer and System Sciences\u00a072(5), 922\u2013953 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR21","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":"35_CR22","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":"35_CR23","unstructured":"Swamy, C.: The effectiveness of Stackelberg strategies and tolls for network congestion games. In: Proc. 18th SODA, pp. 1133\u20131142 (2007)"},{"key":"35_CR24","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","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T00:21:02Z","timestamp":1557966062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}