{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:33:04Z","timestamp":1740807184174,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"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-17572-5_2","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T08:54:45Z","timestamp":1291625685000},"page":"14-25","source":"Crossref","is-referenced-by-count":6,"title":["On Approximate Nash Equilibria in Network Design"],"prefix":"10.1007","author":[{"given":"Susanne","family":"Albers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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, 2273\u20132302 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M., Leighton, T.: Basic network creation games. In: Proc. 22nd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 106\u2013113 (2010)","DOI":"10.1145\/1810479.1810502"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Tucker, A.W., Luce, R.D. (eds.) Contributions to the Theory of Games, vol. IV. Annals of Mathematics Studies, vol.\u00a040, pp. 287\u2013324 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"2_CR4","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, 1602\u20131623 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near optimal network design with selfish agents. Theory of Computing\u00a04, 77\u2013109 (2008)","journal-title":"Theory of Computing"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. In: Proc. 7th ACM Conference on Electronic Commerce (EC), pp. 72\u201381 (2006)","DOI":"10.1145\/1134707.1134716"},{"key":"2_CR7","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":"2_CR8","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H.-L. Chen","year":"2010","unstructured":"Chen, H.-L., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM Journal on Computing\u00a039, 1799\u20131832 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 99\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. In: Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 301\u2013312 (2009)","DOI":"10.1145\/1980522.1980524"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.dss.2004.08.004","volume":"39","author":"N.R. Devanur","year":"2005","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems\u00a039, 11\u201322 (2005)","journal-title":"Decision Support Systems"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Epstein, A., Feldman, M., Mansour, Y.: Strong equilibrium in cost sharing connection games. In: Proc. 8th ACM Conference on Electronic Commerce, pp. 84\u201392 (2007)","DOI":"10.1145\/1250910.1250924"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"2_CR14","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":"2_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s00453-007-9065-y","volume":"50","author":"A. Gupta","year":"2008","unstructured":"Gupta, A., Srinivasan, A., Tardos, E.: Cost-sharing mechanisms for network design. Algorithmica\u00a050, 98\u2013119 (2008)","journal-title":"Algorithmica"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-77105-0_28","volume-title":"Internet and Network Economics","author":"Y. Halevi","year":"2007","unstructured":"Halevi, Y., Mansour, Y.: A network creation game with nonuniform interests. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol.\u00a04858, pp. 287\u2013292. Springer, Heidelberg (2007)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00453-007-9014-9","volume":"53","author":"M. Hoefer","year":"2009","unstructured":"Hoefer, M.: Non-cooperative tree creation. Algorithmica\u00a053, 104\u2013131 (2009)","journal-title":"Algorithmica"},{"key":"2_CR18","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)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In: Proc. 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 165\u2013174 (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-10841-9_16","volume-title":"Internet and Network Economics","author":"T. Nguyen","year":"2009","unstructured":"Nguyen, T., Tardos, E.: Approximate pure Nash equilibria via Lov\u00e1sz local lemma. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 160\u2013171. Springer, Heidelberg (2009)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Pal, M., Tardos, E.: Group strategyproof mechanisms via primal-dual algorithms. In: Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T13:36:59Z","timestamp":1740749819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}