{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:42:06Z","timestamp":1743151326075,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793083"},{"type":"electronic","value":"9783540793090"}],"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-79309-0_4","type":"book-chapter","created":{"date-parts":[[2008,4,19]],"date-time":"2008-04-19T06:31:27Z","timestamp":1208586687000},"page":"22-32","source":"Crossref","is-referenced-by-count":4,"title":["The Influence of Link Restrictions on (Random) Selfish Routing"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. 37th STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in worst-case equilibria. In: Proc. 1st WAOA, pp. 41\u201352 (2003)","DOI":"10.1007\/978-3-540-24592-6_4"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11786986_28","volume-title":"Automata, Languages and Programming","author":"I. Caragiannis","year":"2006","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 311\u2013322. Springer, Heidelberg (2006)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proc. 37th STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proc. 34th STOC, pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"4_CR6","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th SODA, pp. 413\u2013420 (2002)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proc. 36th STOC, pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-540-27836-8_55","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 645\u2013657. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2005.05.011","volume":"343","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Structure and complexity of extreme Nash equilibria. Theoretical Computer Science\u00a0343(1-2), 133\u2013157 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-75520-3_8","volume-title":"Algorithms \u2013 ESA 2007","author":"M. Hoefer","year":"2007","unstructured":"Hoefer, M., Souza, A.: Tradeoffs and average-case equilibria in selfish routing. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 63\u201374. Springer, Heidelberg (2007)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"S. Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing\u00a031, 919\u2013946 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/11600930_100","volume-title":"Internet and Network Economics","author":"S. Kontogiannis","year":"2005","unstructured":"Kontogiannis, S., Spirakis, P.: Atomic selfish routing in networks: A survey. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 989\u20131002. Springer, Heidelberg (2005)"},{"key":"4_CR13","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)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11600930_21","volume-title":"Internet and Network Economics","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Panagopoulou, P., Spirakis, P.: A cost mechanism for fair pricing of resource usage. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 210\u2013224. Springer, Heidelberg (2005)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. In: Proc. 34th STOC, pp. 170\u2013178 (2002)","DOI":"10.1145\/509907.509936"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-540-24749-4_54","volume-title":"STACS 2004","author":"A. Souza","year":"2004","unstructured":"Souza, A., Steger, A.: The expected competitive ratio for weighted completion time scheduling. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 620\u2013631. Springer, Heidelberg (2004)"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-006-1211-4","volume":"47","author":"S. Suri","year":"2007","unstructured":"Suri, S., Toth, C., Zhou, Y.: Selfish load balancing and atomic congestion games. Algorithmica\u00a047(1), 79\u201396 (2007)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79309-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T17:49:40Z","timestamp":1657561780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-79309-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540793083","9783540793090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79309-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}