Nash Equilibrium and Stability in Network Selection Games

Mohit Hota; Sanjiv Kapoor

Game Theory for Networks. 7th International EAI Conference, GameNets 2017 Knoxville, TN, USA, May 9, 2017, Proceedings

Research Article

Nash Equilibrium and Stability in Network Selection Games

Download

221 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-319-67540-4_4,
    author={Mohit Hota and Sanjiv Kapoor},
    title={Nash Equilibrium and Stability in Network Selection Games},
    proceedings={Game Theory for Networks. 7th International EAI Conference, GameNets 2017 Knoxville, TN, USA, May 9, 2017, Proceedings},
    proceedings_a={GAMENETS},
    year={2017},
    month={9},
    keywords={},
    doi={10.1007/978-3-319-67540-4_4}
}

Mohit Hota
Sanjiv Kapoor
Year: 2017
Nash Equilibrium and Stability in Network Selection Games
GAMENETS
Springer
DOI: 10.1007/978-3-319-67540-4_4

Mohit Hota¹^,*, Sanjiv Kapoor¹^,*

1: Illinois Institute of Technology

*Contact email: mhota@hawk.iit.edu, kapoor@iit.edu

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.

Published: 2017-09-19
Appears in: SpringerLink

: http://dx.doi.org/10.1007/978-3-319-67540-4_4

Nash Equilibrium and Stability in Network Selection Games

Abstract

About EAI

Community

Publish with EAI