Skip to main content
SpringerLink
Log in

Nash Equilibrium and Stability in Network Selection Games

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

Included in the following conference series:

Abstract

We study network selection games in wireless networks. Each client selects a base station to maximize her throughput. We utilize a model which incorporates client priority weight and her physical rate on individual Base Stations. The network selection behavior considered is atomic, implying that a client connects to exactly one Base Station.

We formulate a non-cooperative game and study its convergence to a pure Nash equilibrium, if it exists, or prove non-existence otherwise, and present algorithms to discover pure Nash equilibrium for multiple cases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 60.00
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

References

  1. Kuo, G.S.: Mathematical modeling for network selection in heterogeneous wireless networks - a tutorial. IEEE Commun. Surv. Tutorials 15(1), 271–292 (2013)

    Article  Google Scholar 

  2. Malanchini, I., Cesana, M., Gatti, N.: Network selection and resource allocation games for wireless access networks. IEEE Trans. Mob. Comput. 12(12), 2427–2440 (2013)

    Article  Google Scholar 

  3. Aryafar, E., Keshavarz-Haddad, A., Wang, M., Chiang, M.: Rat selection games in hetnets. In: INFOCOM, pp. 998–1006. IEEE (2013)

    Google Scholar 

  4. Monsef, E., Keshavarz-Haddad, A., Aryafar, E., Saniie, J., Chiang, M.: Convergence properties of general network selection games. In: INFOCOM, pp. 1445–1453. IEEE (2015)

    Google Scholar 

  5. Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2, 65–67 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  6. Milchtaich, I.: Weighted congestion games with separable preferences. Games Econ. Behav. 67(2), 750–757 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 604–612. ACM (2004)

    Google Scholar 

  8. Tekin, C., Liu, M., Southwell, R., Huang, J., Ahmad, S.H.A.: Atomic congestion games on graphs and their applications in networking. IEEE/ACM Trans. Netw. 20(5), 1541–1552 (2012)

    Article  Google Scholar 

  9. Ibrahim, M., Khawam, K., Tohm, S.: Congestion games for distributed radio access selection in broadband networks. In: GLOBECOM, pp. 1–5. IEEE (2010)

    Google Scholar 

  10. Shakkottai, S., Altman, E., Kumar, A.: Multihoming of users to access points in wlans: a population game perspective. IEEE J. Sel. Areas Commun. 25(6), 1207–1215 (2007)

    Article  Google Scholar 

  11. Niyato, D., Hossain, E.: Dynamics of network selection in heterogeneous wireless networks: an evolutionary game approach. IEEE Trans. Veh. Technol. 58(4), 2008–2017 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Illinois Institute of Technology, Chicago, IL, 60616, USA

    Mohit Hota & Sanjiv Kapoor

Authors
  1. Mohit Hota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjiv Kapoor
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohit Hota .

Editor information

Editors and Affiliations

  1. Engineering Systems and Design Pillar, Singapore University of Technology and Design, Dover, Singapore

    Lingjie Duan

  2. Virginia Tech, Blacksburg, Virginia, USA

    Anibal Sanjab

  3. Electrical Engineering/Computer Sciences, The University of Tennessee, Knoxville, Tennessee, USA

    Husheng Li

  4. School of Data and Computer Science, Higher Education Mega Center, Sun Yat-sen University, Guangzhou, China

    Xu Chen

  5. University of Tennessee, Knoxville, Tennessee, USA

    Donatello Materassi

  6. Laboratoire Informatique d’Avignon (LIA), University of Avignon, Avignon, France

    Rachid Elazouzi

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

Hota, M., Kapoor, S. (2017). Nash Equilibrium and Stability in Network Selection 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_4

Download citation

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

  • 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

Search

Navigation