Skip to main content

Assortative Mixing Equilibria in Social Network Games

  • Conference paper
  • First Online:
Game Theory for Networks (GameNets 2017)

Abstract

It is known that individuals in social networks tend to exhibit homophily (a.k.a. assortative mixing) in their social ties, which implies that they prefer bonding with others of their own kind. But what are the reasons for this phenomenon? Is it that such relations are more convenient and easier to maintain? Or are there also some more tangible benefits to be gained from this collective behaviour?

The current work takes a game-theoretic perspective on this phenomenon, and studies the conditions under which different assortative mixing strategies lead to equilibrium in an evolving social network. We focus on a biased preferential attachment model where the strategy of each group (e.g., political or social minority) determines the level of bias of its members toward other group members and non-members. Our first result is that if the utility function that the group attempts to maximize is the degree centrality of the group, interpreted as the sum of degrees of the group members in the network, then the only strategy achieving Nash equilibrium is a perfect homophily, which implies that cooperation with other groups is harmful to this utility function. A second, and perhaps more surprising, result is that if a reward for inter-group cooperation is added to the utility function (e.g., externally enforced by an authority as a regulation), then there are only two possible equilibria, namely, perfect homophily or perfect heterophily, and it is possible to characterize their feasibility spaces. Interestingly, these results hold regardless of the minority-majority ratio in the population.

We believe that these results, as well as the game-theoretic perspective presented herein, may contribute to a better understanding of the forces that shape the groups and communities of our society.

Supported in part by a grant of the Israel Science Foundation (1549/13).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In fact, here we extend the model of [3] to allow heterophily.

References

  1. Aumann, R., Myerson, R.: Endogenous formation of links between players and coalitions: an application of the shapley value. In: The Shapley Value, pp. 175–191 (1988)

    Google Scholar 

  2. Avin, C., Daltrophe, H., Lotker, Z., Peleg, D.: Assortative mixing equilibria in social network games. CoRR, abs/1703.08776 (2017)

    Google Scholar 

  3. Avin, C., Keller, B., Lotker, Z., Mathieu, C., Peleg, D., Pignolet, Y.-A.: Homophily and the glass ceiling effect in social networks. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 41–50. ACM (2015)

    Google Scholar 

  4. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bilbao, J.M.: Cooperative Games on Combinatorial Structures, vol. 26. Springer, US (2012). doi:10.1007/978-1-4615-4393-0

    MATH  Google Scholar 

  6. Bramoulle, Y., Currarini, S., Jackson, M.O., Pin, P., Rogers, B.W.: Homophily and long-run integration in social networks. J. Econ. Theor. 147(5), 1754–1786 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, H.-L., Roughgarden, T.: Network design with weighted players. Theor. Comput. Syst. 45(2), 302–324 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Currarini, S., Jackson, M.O., Pin, P.: An economic model of friendship: homophily, minorities, and segregation. Econometrica 77(4), 1003–1045 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Di Stefano, A., Scatà, M., La Corte, A., Liò, P., Catania, E., Guardo, E., Pagano, S.: Quantifying the role of homophily in human cooperation using multiplex evolutionary game theory. PLoS ONE 10(10), e0140646 (2015)

    Article  Google Scholar 

  10. Fu, F., Nowak, M.A., Christakis, N.A., Fowler, J.H.: The evolution of homophily. Scientific reports, 2 (2012)

    Google Scholar 

  11. Jackson, M.O.: A survey of network formation models: stability and efficiency. In: Group Formation in Economics: Networks, Clubs, and Coalitions, pp. 11–49 (2005)

    Google Scholar 

  12. Jackson, M.O., et al.: Social and Economic Networks, vol. 3. Princeton University Press, Princeton (2008)

    MATH  Google Scholar 

  13. Jackson, M.O., López-Pintado, D.: Diffusion and contagion in networks with heterogeneous agents and homophily. Netw. Sci. 1(01), 49–67 (2013)

    Article  Google Scholar 

  14. Jackson, M.O., Watts, A.: The evolution of social and economic networks. J. Econ. Theor. 106(2), 265–295 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lazarsfeld, P.F., Merton, R.K., et al.: Friendship as a social process: a substantive and methodological analysis. Freedom Control Mod. Soc. 18(1), 18–66 (1954)

    Google Scholar 

  16. McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Annu. Rev. Sociol. 27, 415–444 (2001)

    Article  Google Scholar 

  17. Newman, M.E.J.: Mixing patterns in networks. Phys. Rev. E 67, 026126 (2003)

    Article  MathSciNet  Google Scholar 

  18. Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Algorithmic Game Theory, pp. 487–516 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hadassa Daltrophe .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Avin, C., Daltrophe, H., Lotker, Z., Peleg, D. (2017). Assortative Mixing Equilibria in Social Network Games. In: Duan, L., Sanjab, A., Li, H., Chen, X., Materassi, D., Elazouzi, R. (eds) Game Theory for Networks. GameNets 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 212. Springer, Cham. https://doi.org/10.1007/978-3-319-67540-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67540-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67539-8

  • Online ISBN: 978-3-319-67540-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics