{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:13Z","timestamp":1725491833263},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75520-3_8","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"63-74","source":"Crossref","is-referenced-by-count":3,"title":["Tradeoffs and Average-Case Equilibria in 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":"8_CR1","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS 1999, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"8_CR2","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: SODA 2002, pp. 413\u2013420 (2002)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: STOC 2002, pp. 287\u2013296 (2002)","DOI":"10.1145\/509948.509952"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B., Rode, M.: Nash equilibria in discrete routing games with convex latency functions. In: ICALPone 2004, pp. 645\u2013657 (2004)","DOI":"10.1007\/978-3-540-27836-8_55"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: The price of anarchy for polynomial social cost. In: MFCS 2004, vol.\u00a029, pp. 574\u2013585 (2004)","DOI":"10.1007\/978-3-540-28629-5_44"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: STOC 2005, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"2","key":"8_CR7","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"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-24592-6_4","volume-title":"Approximation and Online Algorithms","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in worst-case equilibria. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 41\u201352. Springer, Heidelberg (2004)"},{"key":"8_CR9","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":"8_CR10","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish routing with incomplete information. In: SPAA 2005, vol.\u00a017, pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"8_CR12","unstructured":"Vredeveld, T.: Combinatorial approximation algorithms. Guaranteed versus experimental performance. PhD thesis, Technische Universiteit Eindhoven (2002)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: STOC 2003, pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R. Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 514\u2013526. Springer, Heidelberg (2003)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. In: STOC 2002, vol.\u00a034, pp. 170\u2013178 (2002)","DOI":"10.1145\/509907.509936"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-540-27836-8_31","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2004","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 345\u2013357. Springer, Heidelberg (2004)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V., Schulz, A.: Coordination mechanisms for selfish scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"8_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:03Z","timestamp":1619518983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755197"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_8","relation":{},"subject":[]}}