Skip to main content

Friend of My Friend: Network Formation with Two-Hop Benefit

  • Conference paper
Algorithmic Game Theory (SAGT 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8146))

Included in the following conference series:

Abstract

How and why people form ties is a critical issue for understanding the fabric of social networks. In contrast to most existing work, we are interested in settings where agents are neither so myopic as to consider only the benefit they derive from their immediate neighbors, nor do they consider the effects on the entire network when forming connections. Instead, we consider games on networks where a node tries to maximize its utility taking into account the benefit it gets from the nodes it is directly connected to (called direct benefit), as well as the benefit it gets from the nodes it is acquainted with via a two-hop connection (called two-hop benefit). We call such games Two-Hop Games. The decision to consider only two hops stems from the observation that human agents rarely consider “contacts of a contact of a contact” (3-hop contacts) or further while forming their relationships. We consider several versions of Two-Hop games which are extensions of well-studied games. While the addition of two-hop benefit changes the properties of these games significantly, we prove that in many important cases good equilibrium solutions still exist, and bound the change in the price of anarchy due to two-hop benefit both theoretically and in simulation.

This work was supported in part by NSF awards CCF- 0914782, CCF-1101495, and CNS-1017932.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, D.J., Levavi, A., Manlove, D.F., O’Malley, G.: The stable roommates problem with globally ranked pairs. Internet Mathematics 5(4), 493–515 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Abramson, G., Kuperman, M.: Social games in a social network. Physical Review E 63(3), 030901 (2001)

    Google Scholar 

  3. Anshelevich, E., Das, S., Naamad, Y.: Anarchy, stability, and utopia: Creating better matchings. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 159–170. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Anshelevich, E., Bhardwaj, O., Usher, M.: Friend of my friend: Network formation with two-hop benefit (2013), http://www.cs.rpi.edu/~eanshel/

  5. Anshelevich, E., Hoefer, M.: Contribution games in networks. Algorithmica 63(1-2), 51–90 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Baiou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Applied Mathematics 101(13), 1–12 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bei, X., Chen, W., Teng, S., Zhang, J., Zhu, J.: Bounded budget betweenness centrality game for strategic network formations. Theoretical Computer Science 412(52), 7147–7168 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bramoullé, Y., Kranton, R.: Public goods in networks. Journal of Economic Theory 135(1), 478–494 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Buehler, R., et al.: The price of civil society. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 375–382. Springer, Heidelberg (2011)

    Google Scholar 

  10. Chung, K.S.: On the existence of stable roommate matchings. Games and Economic Behavior 33(2), 206–230 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Corbo, J., Calvó-Armengol, A., Parkes, D.C.: The importance of network topology in local contribution games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 388–395. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Corbo, J., Parkes, D.: The price of selfish behavior in bilateral network formation. In: Proceedings of PODC, pp. 99–107. ACM (2005)

    Google Scholar 

  13. Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of PODC, pp. 347–351. ACM (2003)

    Google Scholar 

  14. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. In: American Mathematical Monthly, pp. 9–15 (1962)

    Google Scholar 

  15. Galeotti, A., Goyal, S., Jackson, M.O., Vega-Redondo, F., Yariv, L.: Network games. The Review of Economic Studies 77(1), 218–244 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hoefer, M., Skopalik, A.: Social context in potential games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 364–377. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Jackson, M.O., Wolinsky, A.: A strategic model of social and economic networks. Journal of Economic Theory 71(1), 44–74 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  18. Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anshelevich, E., Bhardwaj, O., Usher, M. (2013). Friend of My Friend: Network Formation with Two-Hop Benefit. In: Vöcking, B. (eds) Algorithmic Game Theory. SAGT 2013. Lecture Notes in Computer Science, vol 8146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41392-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41392-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41391-9

  • Online ISBN: 978-3-642-41392-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics