{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:05Z","timestamp":1759638005999,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161698"},{"type":"electronic","value":"9783642161704"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16170-4_9","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:07:44Z","timestamp":1286957264000},"page":"90-101","source":"Crossref","is-referenced-by-count":11,"title":["Improved Lower Bounds on the Price of Stability of Undirected Network Design Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[]},{"given":"Angelo","family":"Fanelli","sequence":"additional","affiliation":[]},{"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Albers, S.: On the value of coordination in network design. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 294\u2013303 (2008)"},{"issue":"4","key":"9_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.M., Tardos, E., 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":"9_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":"9_CR4","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":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"ESA 2005","author":"G. Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: 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)"},{"key":"9_CR6","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.) Approximation and Online Algorithms. LNCS, vol.\u00a05893, pp. 86\u201397. Springer, Heidelberg (2010)"},{"key":"9_CR7","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":"9_CR8","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":"9_CR9","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 O(logn\/loglogn) 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":"9_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: 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"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16170-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:54:29Z","timestamp":1553172869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16170-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161698","9783642161704"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16170-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}