{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:20Z","timestamp":1725465560330},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_14","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"158-169","source":"Crossref","is-referenced-by-count":3,"title":["Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games"],"prefix":"10.1007","author":[{"given":"Yann","family":"Disser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas Emil","family":"Feldmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Klimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","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, 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR2","unstructured":"Tardos, \u00c9., Wexler, T.: Network formation games. In: Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press (2007)"},{"key":"14_CR3","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"},{"key":"14_CR4","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\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"14_CR5","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":"14_CR6","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":"14_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Chung, C., Ligett, K., Pyrga, E., van Stee, R.: On the price of stability for undirected network design. In: Proc. 7th International Workshop on Approximation and Online Algorithms, pp. 86\u201397 (2009)","DOI":"10.1007\/978-3-642-12450-1_8"},{"key":"14_CR8","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\u201317 (2011)","journal-title":"Journal of Interconnection Networks"},{"key":"14_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 upper bound on the price of stability for undirected shapley network design games. Information Processing Letters\u00a0109, 876\u2013878 (2009)","journal-title":"Information Processing Letters"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1995.1046","volume":"11","author":"L.E. Blume","year":"1995","unstructured":"Blume, L.E.: The statistical mechanics of best-response strategy revision. Games and Economic Behavior\u00a011, 111\u2013145 (1995)","journal-title":"Games and Economic Behavior"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-642-10841-9_54","volume-title":"Internet and Network Economics","author":"A. Asadpour","year":"2009","unstructured":"Asadpour, A., Saberi, A.: On the inefficiency ratio of stable equilibria in congestion games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 545\u2013552. Springer, Heidelberg (2009)"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-28076-4_22","volume-title":"WALCOM: Algorithms and Computation","author":"Y. Kawase","year":"2012","unstructured":"Kawase, Y., Makino, K.: Nash equilibria with minimum potential in undirected broadcast games. In: Rahman, M. S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 217\u2013228. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:55:13Z","timestamp":1557698113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}