{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:40:51Z","timestamp":1743111651655,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_50","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"626-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Tight Bounds for Cost-Sharing in Weighted Congestion Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gairing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Kollias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammateia","family":"Kotsialou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"5","key":"50_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM Journal on Computing 40(5), 1211\u20131233 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"50_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM Journal on Computing 38(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proceedings of STOC, pp. 57\u201366. ACM (2005)","DOI":"10.1145\/1060590.1060599"},{"issue":"4","key":"50_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2629666","volume":"2","author":"K Bhawalkar","year":"2014","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. ACM Transactions on Economics and Computation 2(4), 14 (2014)","journal-title":"ACM Transactions on Economics and Computation"},{"issue":"2","key":"50_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"HL Chen","year":"2009","unstructured":"Chen, H.L., Roughgarden, T.: Network design with weighted players. Theory of Computing Systems 45(2), 302\u2013324 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"5","key":"50_CR6","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"HL Chen","year":"2010","unstructured":"Chen, H.L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM Journal on Computing 39(5), 1799\u20131832 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-39212-2_44","volume-title":"Automata, Languages, and Programming","author":"G Christodoulou","year":"2013","unstructured":"Christodoulou, G., Gairing, M.: Price of stability in polynomial congestion games. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 496\u2013507. Springer, Heidelberg (2013)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of STOC, pp. 67\u201373. ACM (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007)"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-319-13129-0_6","volume-title":"Web and Internet Economics","author":"V Gkatzelis","year":"2014","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in weighted congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 72\u201388. Springer, Heidelberg (2014)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Mathematics of Operations Research (2014)","DOI":"10.1145\/2492002.2482553"},{"issue":"3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure Nash equilibria in weighted congestion games. Mathematics of Operations Research 37(3), 419\u2013436 (2012)","journal-title":"Mathematics of Operations Research"},{"key":"50_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-18173-8_20","volume-title":"Algorithms and Complexity","author":"M Klimm","year":"2015","unstructured":"Klimm, M., Schmand, D.: Sharing non-anonymous costs of multiple resources optimally. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 274\u2013287. Springer, Heidelberg (2015). arXiv preprint arXiv:1412.4456"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-22012-8_43","volume-title":"Automata, Languages and Programming","author":"K Kollias","year":"2011","unstructured":"Kollias, K., Roughgarden, T.: Restoring pure equilibria to weighted congestion games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 539\u2013551. Springer, Heidelberg (2011)"},{"issue":"2","key":"50_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Computer Science Review 3(2), 65\u201369 (2009)","journal-title":"Computer Science Review"},{"issue":"1","key":"50_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games and Economic Behavior 14(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"50_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"50_CR18","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of STOC, pp. 513\u2013522. ACM (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"50_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-662-44803-8_12","volume-title":"Algorithmic Game Theory","author":"T Roughgarden","year":"2014","unstructured":"Roughgarden, T., Schrijvers, O.: Network cost-sharing without anonymity. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 134\u2013145. Springer, Heidelberg (2014)"},{"issue":"2","key":"50_CR20","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 (JACM) 49(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM (JACM)"},{"issue":"6","key":"50_CR21","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1080\/02331930500342823","volume":"54","author":"A Shapiro","year":"2005","unstructured":"Shapiro, A.: On duality theory of convex semi-infinite programming. Optimization 54(6), 535\u2013543 (2005)","journal-title":"Optimization"},{"key":"50_CR22","unstructured":"Sheffi, Y.: Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall (1985)"},{"issue":"3","key":"50_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0898-1221(99)00203-5","volume":"38","author":"SY Wu","year":"1999","unstructured":"Wu, S.Y., Fang, S.C.: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method. Computers & Mathematics with Applications 38(3), 23\u201333 (1999)","journal-title":"Computers & Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:55:11Z","timestamp":1675860911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}