{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T02:56:30Z","timestamp":1717728990607},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,28]],"date-time":"2016-01-28T00:00:00Z","timestamp":1453939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00453-016-0120-4","type":"journal-article","created":{"date-parts":[[2016,1,28]],"date-time":"2016-01-28T11:56:33Z","timestamp":1453982193000},"page":"921-941","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Price of Anarchy in Bilateral Network Formation in an Adversary Model"],"prefix":"10.1007","volume":"77","author":[{"given":"Lasse","family":"Kliemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,28]]},"reference":[{"issue":"3","key":"120_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s100580000019","volume":"5","author":"V Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A strategic analysis of network reliability. Rev. Econ. Design 5(3), 205\u2013228 (2000). doi: 10.1007\/s100580000019","journal-title":"Rev. Econ. Design"},{"key":"120_CR2","doi-asserted-by":"publisher","unstructured":"Baumann, N., Stiller, S.: The price of anarchy of a network creation game with exponential payoff. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Algorithmic Game Theory, Paderborn, Germany, April and May 2008 (SAGT 2008), Lecture Notes in Computer Science, pp. 218\u2013229 (2008). doi: 10.1007\/978-3-540-79309-0_20","DOI":"10.1007\/978-3-540-79309-0_20"},{"key":"120_CR3","unstructured":"Calv\u00f3-Armengol, A., Ilkili\u00e7, R.: Pairwise stability and Nash equilibria in network formation. Tech. Rep. 34.2005, Fondazione Eni Enrico Mattei (2005). http:\/\/ssrn.com\/abstract=677995"},{"key":"120_CR4","unstructured":"Chun, B.G., Fonseca, R., Stoica, I., Kubiatowicz, J.: Characterizing selfishly constructed overlay routing networks. In: Proceedings of the 23rd IEEE Conference on Computer Communications, Hong Kong, China, March 2004 (INFOCOM 2004) (2004). http:\/\/www.ieee-infocom.org\/2004\/Papers\/28_4.PDF"},{"key":"120_CR5","doi-asserted-by":"publisher","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Las Vegas, Nevada, USA, July 2005 (PODC 2005), pp. 99\u2013107 (2005). doi: 10.1145\/1073814.1073833","DOI":"10.1145\/1073814.1073833"},{"key":"120_CR6","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Berlin. http:\/\/diestel-graph-theory.com\/index.html , the URL points to a newer edition since 2011 (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"120_CR7","doi-asserted-by":"publisher","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Boston, Massachusetts, USA, July 2003 (PODC 2003), pp. 347\u2013351 (2003). doi: 10.1145\/872035.872088","DOI":"10.1145\/872035.872088"},{"issue":"2","key":"120_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.mathsocsci.2005.02.003","volume":"50","author":"H Haller","year":"2005","unstructured":"Haller, H., Sarangi, S.: Nash networks with heterogeneous links. Math. Soc. Sci. 50(2), 181\u2013201 (2005). doi: 10.1016\/j.mathsocsci.2005.02.003 . see also the related working paper Sarangi and Haller (2003) from 2003","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"120_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jeth.1996.0108","volume":"71","author":"MO Jackson","year":"1996","unstructured":"Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. J. Econ. Theory 71(1), 44\u201374 (1996). doi: 10.1006\/jeth.1996.0108","journal-title":"J. Econ. Theory"},{"key":"120_CR10","doi-asserted-by":"publisher","unstructured":"Kliemann, L.: Brief announcement: the price of anarchy for distributed network formation in an adversary model. In: Proceedings of the 29th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Zurich, Switzerland, July 2010 (PODC 2010), pp. 229\u2013230 (2010). doi: 10.1145\/1835698.1835749","DOI":"10.1145\/1835698.1835749"},{"issue":"3","key":"120_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.3390\/g2030302","volume":"2","author":"L Kliemann","year":"2011","unstructured":"Kliemann, L.: The price of anarchy for network formation in an adversary model. Games 2(3), 302\u2013332 (2011). doi: 10.3390\/g2030302","journal-title":"Games"},{"key":"120_CR12","doi-asserted-by":"crossref","unstructured":"Kliemann, L.: The price of anarchy for network formation in an adversary model. http:\/\/arxiv.org\/abs\/1202.5025 , This is an extended version of my article in Games 2(3), 2011. It features improved constants and some preliminary results for bilateral link formation (2012)","DOI":"10.3390\/g2030302"},{"key":"120_CR13","doi-asserted-by":"publisher","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 1999 (STACS 1999), pp. 404\u2013413 (1999). doi: 10.1007\/3-540-49116-3_38","DOI":"10.1007\/3-540-49116-3_38"},{"key":"120_CR14","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict, fifth printing edn. Harvard University Press, Cambridge (first printing in 1991) (2002)"},{"key":"120_CR15","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Crete, Greece, July 2001 (STOC 2001), pp. 749\u2013753 (2001). doi: 10.1145\/380752.380883","DOI":"10.1145\/380752.380883"},{"key":"120_CR16","unstructured":"Sarangi, S., Haller, H.: Nash networks with heterogeneous agents. Departmental Working Papers 2003-06, Department of Economics, Louisiana State University (2003). http:\/\/ideas.repec.org\/p\/lsu\/lsuwpp\/2003-06.html"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0120-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0120-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0120-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0120-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T22:57:03Z","timestamp":1567551423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0120-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,28]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["120"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0120-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,28]]}}}