Skip to main content
Springer Nature Link
Log in

Time-Consistent Solutions for Two-Stage Network Games with Pairwise Interactions

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In the paper, we consider a cooperative version of a network game with pairwise interactions in which connected players play bimatrix games. For a particular type of a network, a simplified formula for the Shapley value based on a constructed characteristic function is derived. We then show the time inconsistency of classical cooperative solutions — the Shapley value and the core. The findings are applied to two important classes of bimatrix games: prisoner’s dilemma and a coordination game.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Acemoglu D, Ozdaglar A, ParandehGheibi A (2010) A Spread of (mis)information in social networks. Game Econ Behav 70(2):194–227

    Article  MathSciNet  Google Scholar 

  2. Aumann R, Myerson R (1988) Endogenous formation of links between players and coalitions: An application of the Shapley value. In: Roth A (ed) The Shapley value: Essays in Honor of Lloyd S. Shapley. Cambridge University Press, Cambridge, pp 175–191

  3. Bala V, Goyal S (2000) A noncooperative model of network formation. Econometrica 68(5):1181–1229

    Article  MathSciNet  Google Scholar 

  4. Bulgakova MA, Petrosyan LA (2016) About strongly time-consistency of core in the network game with pairwise interactions. In: Proceedings of 2016 international conference “Stability and Oscillations of Nonlinear Control Systems”, pp 157–160

  5. Challita U, Saad W (2017) Network formation in the sky: Unmanned aerial vehicles for multi-hop wireless backhauling. In: Proceedings of the IEEE global communications conference (GLOBECOM), Singapore, 4–8

  6. Corbae D, Duffy J (2008) Experiments with network formation. Games Econ Behav 64:81–120

    Article  Google Scholar 

  7. Dyer M, Mohanaraj V (2011) Pairwise-interaction games. In: Aceto, L, Henzinger, M, Sgall, J (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6755, pp 159-170

  8. Dziubiński M, Goyal S (2013) Network design and defense. Game Econ Behav 79:30–43

    Article  Google Scholar 

  9. Goyal S, Vega-Redondo F (2005) Network formation and social coordination. Games Econ Behav 50:178–207

    Article  MathSciNet  Google Scholar 

  10. Hernández P, Muñoz-Herrera M, Sánchez Á (2013) Heterogeneous network games: Conflicting preference. Game Econ Behav 79:56–66

    Article  MathSciNet  Google Scholar 

  11. Jackson M, Watts A (2002) On the formation of interaction networks in social coordination games. Games Econ Behav 41(2):265–291

    Article  MathSciNet  Google Scholar 

  12. König MD, Battiston S, Napoletano M, Schweitzer F (2012) The efficiency and stability of R&D networks. Game Econ Behav 75(2):694–713

    Article  MathSciNet  Google Scholar 

  13. Mozaffari M, Saad W, Bennis M, Debbah M (2016) Unmanned aerial vehicle with underlaid device-to-device communications: Performance and tradeoffs. IEEE Trans Wirel Commun 15(6):3949–3963

    Article  Google Scholar 

  14. Petrosyan LA, Danilov NN (1979) Stability of solutions of non-zero-sum game with transferable payoffs. Vestnik Leningradskogo Universiteta Ser 1 Mat Mekhanika Astron 19:52–59

    MATH  Google Scholar 

  15. Petrosyan LA, Sedakov AA (2014) Multistage network games with perfect information. Automat Rem Contr 75(8):1532–1540

    Article  MathSciNet  Google Scholar 

  16. Petrosyan LA, Sedakov AA (2016) The subgame-consistent shapley value for dynamic network games with shock. Dyn Games Appl 6(4):520–537

    Article  MathSciNet  Google Scholar 

  17. Petrosyan LA, Sedakov AA, Bochkarev AO (2016) Two-stage network games. Automat Rem Contr 77(10):1855–1866

    Article  MathSciNet  Google Scholar 

  18. Shapley L (1953) A value for n-person games. In: Kuhn H W, Tucker A W (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307–317

  19. Von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton

    MATH  Google Scholar 

  20. Saad W, Han Z, Başar T, Debbah M, Hjrungnes A (2011) Network formation games among relay stations in next generation wireless networks. IEEE Trans Commun 59(9):2528–2542

    Article  Google Scholar 

  21. Xie F, Cui W, Lin J (2013) Prisoners dilemma game on adaptive networks under limited foresight. Complexity 18:38–47

    Article  Google Scholar 

Download references

Acknowledgements

The authors thank two anonymous referees for their comments that have helped in the improvement of the paper. This research was supported by the Russian Science Foundation (grant No. 17-11-01079).

Author information

Authors and Affiliations

  1. Saint Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg, 199034, Russia

    Leon Petrosyan, Mariia Bulgakova & Artem Sedakov

Authors
  1. Leon Petrosyan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Mariia Bulgakova
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Artem Sedakov
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Artem Sedakov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Petrosyan, L., Bulgakova, M. & Sedakov, A. Time-Consistent Solutions for Two-Stage Network Games with Pairwise Interactions. Mobile Netw Appl 26, 491–500 (2021). https://doi.org/10.1007/s11036-018-1127-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-018-1127-7

Keywords