{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:19:03Z","timestamp":1762917543665},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,3]],"date-time":"2014-10-03T00:00:00Z","timestamp":1412294400000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00224-014-9582-4","type":"journal-article","created":{"date-parts":[[2014,10,2]],"date-time":"2014-10-02T07:41:38Z","timestamp":1412235698000},"page":"711-752","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Friend of My Friend: Network Formation with Two-Hop Benefit"],"prefix":"10.1007","volume":"57","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Onkar","family":"Bhardwaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Usher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,3]]},"reference":[{"issue":"4","key":"9582_CR1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1080\/15427951.2008.10129167","volume":"5","author":"DJ Abraham","year":"2008","unstructured":"Abraham, D.J., Levavi, A., Manlove, D.F., O\u2019Malley, G.: The stable roommates problem with globally ranked pairs. Internet Math. 5(4), 493\u2013515 (2008)","journal-title":"Internet Math."},{"issue":"3","key":"9582_CR2","doi-asserted-by":"crossref","first-page":"030901","DOI":"10.1103\/PhysRevE.63.030901","volume":"63","author":"G Abramson","year":"2001","unstructured":"Abramson, G., Kuperman, M.: Social games in a social network. Phys. Rev. E 63(3), 030901 (2001)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"9582_CR3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/090771478","volume":"27","author":"N Alon","year":"2013","unstructured":"Alon, N., Demaine, E.D., Hajiaghayi, M.T., Leighton, T.: Basic network creation games. SIAM J. Discret. Math. 27(2), 656\u2013668 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"9582_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Das, S., Naamad, Y.: Anarchy, stability, and utopia: creating better matchings. In: SAGT (2009)","DOI":"10.1007\/978-3-642-04645-2_15"},{"issue":"1-2","key":"9582_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00453-011-9520-7","volume":"63","author":"E Anshelevich","year":"2012","unstructured":"Anshelevich, E., Hoefer, M.: Contribution games in networks. Algorithmica 63(1-2), 51\u201390 (2012)","journal-title":"Algorithmica"},{"issue":"13","key":"9582_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Baiou","year":"2000","unstructured":"Baiou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discret. Appl. Math. 101(13), 1\u201312 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"52","key":"9582_CR7","doi-asserted-by":"crossref","first-page":"7147","DOI":"10.1016\/j.tcs.2011.09.028","volume":"412","author":"Xi Bei","year":"2011","unstructured":"Bei, Xi., Chen, W., Teng, S., Zhang, J., Zhu, J.: Bounded budget betweenness centrality game for strategic network formations. Theor. Comput. Sci. 412(52), 7147\u20137168 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9582_CR8","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.jet.2006.06.006","volume":"135","author":"Y Bramoull\u00e9","year":"2007","unstructured":"Bramoull\u00e9, Y., Kranton, R.: Public goods in networks. J. Econ. Theory 135(1), 478\u2013494 (2007)","journal-title":"J. Econ. Theory"},{"key":"9582_CR9","doi-asserted-by":"crossref","unstructured":"Brandes, U., Hoefer, M., Nick, B.: Network creation games with disconnected equilibria. In: WINE (2008)","DOI":"10.1007\/978-3-540-92185-1_45"},{"key":"9582_CR10","doi-asserted-by":"crossref","unstructured":"Buehler, R., Goldman, Z., Liben-Nowell, D., Pei, Y., Quadri, J., Sharp, A., Taggart, S., Wexler, T., Woods, K.: The price of civil society. WINE (2011)","DOI":"10.1007\/978-3-642-25510-6_32"},{"issue":"2","key":"9582_CR11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1006\/game.1999.0779","volume":"33","author":"KS Chung","year":"2000","unstructured":"Chung, K.S.: On the existence of stable roommate matchings. Games Econ. Behav. 33(2), 206\u2013230 (2000)","journal-title":"Games Econ. Behav."},{"key":"9582_CR12","doi-asserted-by":"crossref","unstructured":"Corbo, J., Calv\u00f3-Armengol, A., Parkes, D.: The importance of network topology in local contribution games. WINE (2007)","DOI":"10.1007\/978-3-540-77105-0_43"},{"key":"9582_CR13","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proceedings of PODC, pp. 99\u2013107. ACM (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"9582_CR14","doi-asserted-by":"crossref","unstructured":"Demaine, E., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp. 292\u2013298. ACM (2007)","DOI":"10.1145\/1281100.1281142"},{"key":"9582_CR15","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of PODC, pp. 347\u2013351. ACM (2003)","DOI":"10.1145\/872035.872088"},{"key":"9582_CR16","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon., 9\u201315 (1962)","DOI":"10.2307\/2312726"},{"issue":"1","key":"9582_CR17","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1111\/j.1467-937X.2009.00570.x","volume":"77","author":"A Galeotti","year":"2010","unstructured":"Galeotti, A., Goyal, S., Jackson, M.O., Vega-Redondo, F., Yariv, L.: Network games. Rev. Econ. Stud. 77(1), 218\u2013244 (2010)","journal-title":"Rev. Econ. Stud."},{"key":"9582_CR18","unstructured":"Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms (1989)"},{"key":"9582_CR19","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Krysta, P.: Geometric network design with selfish agents. In: Computing and Combinatorics, pp. 167\u2013178. Springer (2005)","DOI":"10.1007\/11533719_19"},{"key":"9582_CR20","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Skopalik, A.: Social context in potential games. In: WINE (2012)","DOI":"10.1007\/978-3-642-35311-6_27"},{"issue":"1","key":"9582_CR21","doi-asserted-by":"crossref","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)","journal-title":"J. Econ. Theory"},{"key":"9582_CR22","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Poplawski, L., Rajaraman, R., Sundaram, R., Teng, S.: Bounded budget connection (bbc) games or how to make friends and influence people, on a budget. In: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, pp. 165\u2013174. ACM (2008)","DOI":"10.1145\/1400751.1400774"},{"key":"9582_CR23","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of matching under preferences. World Scientific Publishing (2013)","DOI":"10.1142\/8591"},{"key":"9582_CR24","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT press (1994)"},{"key":"9582_CR25","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: a study in game-theoretic modeling and analysis, vol. 18. Cambridge University Press (1992)"},{"issue":"3","key":"9582_CR26","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1287\/moor.1060.0207","volume":"31","author":"J Sethuraman","year":"2006","unstructured":"Sethuraman, J., Teo, C.P., Qian, L.: Many-to-one stable matching: geometry and fairness. Math. Oper. Res. 31(3), 581\u2013596 (2006)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9582_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0165-4896(98)00048-1","volume":"38","author":"M Sotomayor","year":"1999","unstructured":"Sotomayor, M.: Three remarks on the many-to-many stable matching problem. Math. Social Sci. 38(1), 55\u201370 (1999)","journal-title":"Math. Social Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9582-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9582-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9582-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T19:19:37Z","timestamp":1565896777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9582-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,3]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9582"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9582-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,3]]}}}