{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:22Z","timestamp":1725738562623},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_44","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"496-507","source":"Crossref","is-referenced-by-count":5,"title":["Price of Stability in Polynomial Congestion Games"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gairing","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"44_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\u00a040(5), 1211\u20131233 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"44_CR2","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S. Albers","year":"2009","unstructured":"Albers, S.: On the value of coordination in network design. SIAM Journal on Computing\u00a038(6), 2273\u20132302 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"44_CR3","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.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM Journal on Computing\u00a038(4), 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: Large the price of routing unsplittable flow. In: Proceedings of STOC, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-15781-3_2","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Bhawalkar","year":"2010","unstructured":"Bhawalkar, K., Gairing, M., Roughgarden, T.: Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 17\u201328. Springer, Heidelberg (2010)"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-38016-7_18","volume-title":"Approximation and Online Algorithms","author":"V. Bil\u00f2","year":"2013","unstructured":"Bil\u00f2, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol.\u00a07846, pp. 215\u2013228. Springer, Heidelberg (2013)"},{"issue":"1-2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219265911002824","volume":"12","author":"V. Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Bove, R.: Bounds on the price of stability of undirected network design games with three players. Journal of Interconnection Networks\u00a012(1-2), 1\u201317 (2011)","journal-title":"Journal of Interconnection Networks"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-16170-4_9","volume-title":"Algorithmic Game Theory","author":"V. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, V., Caragiannis, I., Fanelli, A., Monaco, G.: Improved lower bounds on the price of stability of undirected network design games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol.\u00a06386, pp. 90\u2013101. Springer, Heidelberg (2010)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I. Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica\u00a061, 606\u2013637 (2011)","journal-title":"Algorithmica"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H.-L. Chen","year":"2009","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. Theory of Computing Systems\u00a045, 302\u2013324 (2009)","journal-title":"Theory of Computing Systems"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The price of anarchy of finite congestion games. In: Proceedings of STOC, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-12450-1_8","volume-title":"Approximation and Online Algorithms","author":"G. Christodoulou","year":"2010","unstructured":"Christodoulou, G., Chung, C., Ligett, K., Pyrga, E., van Stee, R.: On the price of stability for undirected network design. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 86\u201397. Springer, Heidelberg (2010)"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 59\u201370. Springer, Heidelberg (2005)"},{"issue":"1","key":"44_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-010-9449-2","volume":"61","author":"G. Christodoulou","year":"2011","unstructured":"Christodoulou, G., Koutsoupias, E., Spirakis, P.G.: On the performance of approximate equilibria in congestion games. Algorithmica\u00a061(1), 116\u2013140 (2011)","journal-title":"Algorithmica"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Disser, Y., Feldmann, A.E., Klimm, M., Mihal\u00e1k, M.: Improving the h\n                  \n                    k\n                  -bound on the price of stability in undirected shapley network design games. CoRR, abs\/1211.2090 (2012); To appear in CIAC 2013","DOI":"10.1007\/978-3-642-38233-8_14"},{"key":"44_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A. Fiat","year":"2006","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 608\u2013618. Springer, Heidelberg (2006)"},{"key":"44_CR17","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)"},{"issue":"15","key":"44_CR18","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J. Li","year":"2009","unstructured":"Li, J.: An \n                    \n                      \n                    \n                    $O(\\frac{\\log n}{\\log\\log n})$\n                   upper bound on the price of stability for undirected Shapley network design games. Information Processing Letters\u00a0109(15), 876\u2013878 (2009)","journal-title":"Information Processing Letters"},{"key":"44_CR19","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.: Potential games. Games and Economics Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economics Behavior"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"7","key":"44_CR21","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/2209249.2209274","volume":"55","author":"T. Roughgarden","year":"2012","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. Communications of the ACM\u00a055(7), 116\u2013123 (2012)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:26:34Z","timestamp":1557912394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}