Network Games

  • S. Rasoul EtesamiEmail author
  • Tamer Başar
Reference work entry


This chapter provides a general overview of the topic of network games, its application in a number of areas, and recent advances, by focusing on four major types of games, namely, congestion games, resource allocation games, diffusion games, and network formation games. Several algorithmic aspects and methodologies for analyzing such games are discussed, and connections between network games and other relevant topical areas are identified.


Network games Congestion games Diffusion games Potential games Resource allocation Network formation Nash equilibrium Price of anarchy 


  1. Ackermann H, Röglin H, Vöcking B (2008) On the impact of combinatorial structure on congestion games. J ACM (JACM) 55(6):25Google Scholar
  2. Alon N, Feldman M, Procaccia AD, Tennenholtz M (2010) A note on competitive diffusion through social networks. Inf Process Lett 110(6):221–225Google Scholar
  3. Alon N, Demaine ED, Hajiaghayi MT, Leighton T (2013) Basic network creation games. SIAM J Discret Math 27(2):656–668Google Scholar
  4. Alpcan T, Başar T (2010) Network security: a decision and game-theoretic approach. Cambridge University Press, LeidenGoogle Scholar
  5. Altman E (2014) Bio-inspired paradigms in network engineering games. J Dyn Games (JDG) 1(1):1–15Google Scholar
  6. Altman E, Boulogne T, El-Azouzi R, Jiménez T, Wynter L (2006) A survey on networking games in telecommunications. Comput Oper Res 33(2):286–311Google Scholar
  7. Anantharam V (2004) On the Nash dynamics of congestion games with player-specific utility. In: IEEE conference on decision and control, vol 5. IEEE, pp 4673–4678Google Scholar
  8. Awerbuch B, Azar Y, Epstein A, Mirrokni VS, Skopalik A (2008) Fast convergence to nearly optimal solutions in potential games. In: Proceedings of the 9th ACM conference on electronic commerce. ACM, pp 264–273Google Scholar
  9. Başar T (2007) Control and game-theoretic tools for communication networks. Appl Comput Math 6(2):104–125Google Scholar
  10. Başar T, Olsder GJ (1999) Dynamic noncooperative game theory. SIAM, PhiladelphiaGoogle Scholar
  11. Blum A, Even-Dar E, Ligett K (2006) Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing. ACM, pp 45–52Google Scholar
  12. Bramoullé Y, Kranton R, D’amours M (2014) Strategic interaction and networks. Am Econ Rev 104(3):898–930Google Scholar
  13. Bolouki S, Nedić A, Başar T (2017) Social networks. In: Başar T, Zaccour G (eds) Handbook of dynamic game theory. Springer International Publishing, ChamGoogle Scholar
  14. Caines PE, Huang M, Malhamé RP (2017) Mean field games. In: Başar T, Zaccour G (eds) Handbook of Dynamic Game Theory. Springer International Publishing, ChamGoogle Scholar
  15. Chun B-G, Chaudhuri K, Wee H, Barreno M, Papadimitriou CH, Kubiatowicz J (2004) Selfish caching in distributed systems: a game-theoretic analysis. In: Proceedings of the twenty-third annual ACM symposium on principles of distributed computing. ACM, pp 21–30Google Scholar
  16. Correa JR, Schulz AS, Stier-Moses NE (2004) Selfish routing in capacitated networks. Math Oper Res 29(4):961–976Google Scholar
  17. Daskalakis C, Papadimitriou CH (2006) Computing pure Nash equilibria in graphical games via Markov random fields. In: Proceedings of the 7th ACM conference on electronic commerce. ACM, pp 91–99Google Scholar
  18. Demaine ED, Hajiaghayi MT, Mahini H, Zadimoghaddam M (2007) The price of anarchy in network creation games. In: Proceedings of the twenty-sixth annual ACM symposium on principles of distributed computing. ACM, pp 292–298Google Scholar
  19. Dürr C, Thang N (2007) Nash equilibria in Voronoi games on graphs. In: Algorithms-ESA, pp 17–28Google Scholar
  20. Eksin C, Molavi P, Ribeiro A, Jadbabaie A (2013) Learning in network games with incomplete information: asymptotic analysis and tractable implementation of rational behavior. IEEE Signal Process Mag 30(3):30–42Google Scholar
  21. Etesami SR, Başar T (2015) Game-theoretic analysis of the Hegselmann-Krause model for opinion dynamics in finite dimensions. IEEE Trans Autom Control 60(7):1886–1897Google Scholar
  22. Etesami SR, Başar T (2016) Complexity of equilibrium in competitive diffusion games on social networks. Automatica 68:100–110Google Scholar
  23. Etesami SR, Başar T (2017a) Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game. Automatica 76:153–163Google Scholar
  24. Etesami SR, Başar T (2017b) Pure Nash equilibrium in a binary capacitated resource allocation game. IEEE Trans Control Netw Syst., Published online: 22 Nov 2016
  25. Etesami SR, Saad W, Mandayam N, Poor HV (2017) Smart routing in smart grids. In: Proceedings of the 56th IEEE Conference on Decision and Control, Melbourne, 12–15 Dec.
  26. Fabrikant A, Luthra A, Maneva E, Papadimitriou CH, Shenker S (2003) On a network creation game. In: Proceedings of the twenty-second annual symposium on principles of distributed computing. ACM, pp 347–351Google Scholar
  27. Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure Nash equilibria. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing. ACM, pp 604–612Google Scholar
  28. Galeotti A, Goyal S, Jackson MO, Vega-Redondo F, Yariv L (2010) Network games. Rev Econ Stud 77(1):218–244Google Scholar
  29. Gionis A, Terzi E, Tsaparas P (2013) Opinion maximization in social networks. In: Proceedings of the 2013 SIAM international conference on data mining. SIAM, pp 387–395Google Scholar
  30. Goemans MX, Li L, Mirrokni VS, Thottan M (2006) Market sharing games applied to content distribution in ad hoc networks. IEEE J Sel Areas Commun 24(5):1020–1033Google Scholar
  31. Gopalakrishnan R, Kanoulas D, Karuturi NN, Rangan CP, Rajaraman R, Sundaram R (2012) Cache me if you can: capacitated selfish replication games. In: LATIN. Springer, pp 420–432Google Scholar
  32. Goyal S, Vega-Redondo F (2000) Learning, network formation and coordination. Technical report, Tinbergen Institute Discussion PaperGoogle Scholar
  33. Goyal S, Heidari H, Kearns M (2014) Competitive contagion in networks. Games Econ Behav.,
  34. Grossklags J, Christin N, Chuang J (2008) Secure or insure? A game-theoretic analysis of information security games. In: Proceedings of the 17th International Conference on World Wide Web. ACM, pp 209–218Google Scholar
  35. Jackson MO (2005) A survey of network formation models: stability and efficiency. In: Group formation in economics: networks, clubs, and coalitions. Cambridge University Press, Cambridge, pp 11–49Google Scholar
  36. Jackson MO (2010) Social and economic networks. Princeton University Press, PrincetonGoogle Scholar
  37. Jackson MO, Watts A (2002) On the formation of interaction networks in social coordination games. Games Econ Behav, 41(2):265–291Google Scholar
  38. Jackson MO, Wolinsky A (1996) A strategic model of social and economic networks. J Econ Theory 71(1):44–74Google Scholar
  39. Jackson MO, Yariv L (2007) Diffusion of behavior and equilibrium properties in network games. Am Econ Rev 97(2):92–98Google Scholar
  40. Jensen MK (2010) Aggregative games and best-reply potentials. Econ Theory 43(1):45–66Google Scholar
  41. Kawald B, Lenzner P (2013) On dynamics in selfish network creation. In: Proceedings of the twenty-fifth annual ACM symposium on parallelism in algorithms and architectures. ACM, pp 83–92Google Scholar
  42. Kearns M, Littman ML, Singh S (2001) Graphical models for game theory. In: Proceedings of the seventeenth conference on uncertainty in artificial intelligence. Morgan Kaufmann Publishers Inc., pp 253–260Google Scholar
  43. Krichene W, Reilly JD, Amin S, Bayen AM (2017) Stackelberg routing on parallel transportation networks. In: Başar T, Zaccour G (eds) Handbook of Dynamic Game Theory. Springer International Publishing, ChamGoogle Scholar
  44. Koshal J, Nedić A, Shanbhag UV (2016) Distributed algorithms for aggregative games on graphs. Oper Res 64(3):680–704Google Scholar
  45. Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: STACSGoogle Scholar
  46. Laoutaris N, Telelis O, Zissimopoulos V, Stavrakakis I (2006) Distributed selfish replication. IEEE Trans Parallel Distrib Syst 17(12):1401–1413Google Scholar
  47. Lenzner P (2011) On dynamics in basic network creation games. In: Algorithmic game theory. Springer, Berlin/London, pp 254–265Google Scholar
  48. Li N, Marden JR (2013) Designing games for distributed optimization. IEEE J Sel Top Sign Proces 7(2):230–242Google Scholar
  49. Liang X, Xiao Y (2012) Game theory for network security. IEEE Commun Surv Tutor 15(1):472–486Google Scholar
  50. Maheswaran RT, Başar T (2001) Decentralized network resource allocation as a repeated noncooperative market game. In: Proceedings of the 40th IEEE conference on decision and control, vol 5. IEEE, pp 4565–4570Google Scholar
  51. Marden JR, Roughgarden T (2014) Generalized efficiency bounds in distributed resource allocation. IEEE Trans Autom Control 59(3):571–584Google Scholar
  52. Marden JR, Arslan G, Shamma JS (2007) Regret based dynamics: convergence in weakly acyclic games. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems. ACM, p 42Google Scholar
  53. Menache I, Ozdaglar A (2011) Network games: theory, models, and dynamics. Synth Lect Commun Netw 4(1):1–159Google Scholar
  54. Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econ Behav 13(1):111–124Google Scholar
  55. Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124–143Google Scholar
  56. Montanari A, Saberi A (2010) The spread of innovations in social networks. Proc Natl Acad Sci 107(47):20196–20201Google Scholar
  57. Murray C (2012) Markets in political influence: rent-seeking, networks and groups. Technical report, University Library of MunichGoogle Scholar
  58. Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory, vol 1. Cambridge University Press, Cambridge/New YorkGoogle Scholar
  59. Pacifici V, Dan G (2012) Convergence in player-specific graphical resource allocation games. IEEE J Sel Areas Commun 30(11):2190–2199Google Scholar
  60. Panagopoulou P, Spirakis P (2008) A game theoretic approach for efficient graph coloring. In: Algorithms and computation, pp 183–195Google Scholar
  61. Parise F, Gentile B, Grammatico S, Lygeros J (2015) Network aggregative games: distributed convergence to Nash equilibria. In: 54th Annual Conference on Decision and Control (CDC). IEEE, pp 2295–2300Google Scholar
  62. Pollatos GG, Telelis OA, Zissimopoulos V (2008) On the social cost of distributed selfish content replication. In: International conference on research in networking. Springer, pp 195–206Google Scholar
  63. Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Int J Game Theory 2(1):65–67Google Scholar
  64. Roughgarden T (2002) Selfish routing. Technical report, Ph.D. Dissertation, Cornell University, IthacaGoogle Scholar
  65. Roughgarden T, Schrijvers O (2016) Network cost-sharing without anonymity. ACM Trans Econ Comput 4(2):8Google Scholar
  66. Saad W, Han Z, Başar T, Debbah M, Hjorungnes A (2011) Network formation games among relay stations in next generation wireless networks. IEEE Trans Commun 59(9):2528–2542Google Scholar
  67. Saad W, Zhou X, Maham B, Başar T, Poor HV (2012) Tree formation with physical layer security considerations in wireless multi-hop networks. IEEE Trans Wirel Commun 11(11):3980–3991Google Scholar
  68. Shakkottai S, Srikant R (2017) Communication networks: pricing, congestion control, routing and scheduling. In: Başar T, Zaccour G (eds) Handbook of Dynamic Game Theory. Springer International Publishing, ChamGoogle Scholar
  69. Singer Y (2012) How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: Proceedings of the fifth ACM international conference on web search and data mining. ACM, pp 733–742Google Scholar
  70. Small L, Mason O (2013) Information diffusion on the iterated local transitivity model of online social networks. Discret Appl Math 161(10):1338–1344MathSciNetCrossRefGoogle Scholar
  71. Tekin C, Liu M, Southwell R, Huang J, Ahmad SHA (2012) Atomic congestion games on graphs and their applications in networking. IEEE/ACM Trans Netw (TON) 20(5):1541–1552CrossRefGoogle Scholar
  72. Tzoumas V, Amanatidis C, Markakis E (2012) A game-theoretic analysis of a competitive diffusion process over social networks. In: Proceedings of the 8th International Conference on Internet and Network Economics. Springer, pp 1–14Google Scholar
  73. Vetta A (2002) Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. IEEE, pp 416–425Google Scholar
  74. Young HP (2006) The diffusion of innovations in social networks. In: The economy as an evolving complex system III: current perspectives and future directions, vol 267. Oxford University Press, Oxford/New YorkGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  2. 2.Coordinated Science Laboratory and Department of Electrical and Computer EngineeringUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations