{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:40:50Z","timestamp":1743054050731,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180088"},{"type":"electronic","value":"9783642180095"}],"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-18009-5_12","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:31:28Z","timestamp":1291303888000},"page":"122-131","source":"Crossref","is-referenced-by-count":2,"title":["Constant Price of Anarchy in Network Creation Games via Public Service Advertising"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Zadimoghaddam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash Equilibria for a Network Creation Game. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, pp. 89\u201398 (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Improved equilibria via public service advertising. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, New York, NY, pp. 728\u2013737 (2009)","DOI":"10.1137\/1.9781611973068.80"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selish behavior in bilateral network formation. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, Las Vegas, Nevada, pp. 99\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The Price of Anarchy in Cooperative Network Creation Games. Appeared in SIGecom Exchanges 8.2 (December 2009); A preliminary version of this paper appeared in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp. 171\u2013182 (2009)","DOI":"10.1145\/1980522.1980524"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The Price of Anarchy in Network Creation Games. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 292\u2013298 (2007); To appear in ACM Transactions on Algorithms","DOI":"10.1145\/1281100.1281142"},{"key":"12_CR6","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, Massachusetts, pp. 347\u2013351"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Small-World Phenomena and the Dynamics of Information. In: Advances in Neural Information Processing Systems (NIPS), vol.\u00a014 (2001)","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)","DOI":"10.1145\/335305.335325"},{"key":"12_CR9","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":"12_CR10","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: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 165\u2013174 (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"12_CR11","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, Greece, pp. 749\u2013753"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18009-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T18:25:47Z","timestamp":1711995947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}