2011/05/11 by François Mériaux, Samson Lasaulce, Mériaux, François +3
Business, Management and Accounting · Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Facility Location and Emergency Management #Game Theory and Applications #Game Theory and Voting Systems #Networking and Internet Architecture (cs.NI) #cs.GT #cs.NI
paper · pdf · doi:10.48550/arxiv.1105.2243
ValueTools '11: 6th International Conference on Performance Evaluation Methodologies and Tools, May 2011, Paris, France
arxiv created 2011/05/11 · openalex publication_date 2011/05/11 · arxiv updated 2011/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper addresses the problem of locating base stations in a certain area which is highly populated by mobile stations; each mobile station is assumed to select the closest base station. Base stations are modeled by players who choose their best location for maximizing their uplink throughput. The approach of this paper is to make some simplifying assumptions in order to get interpretable analytical results and insights to the problem under study. Specifically, a relatively complete Nash equilibrium (NE) analysis is conducted (existence, uniqueness, determination, and efficiency). Then, assuming that the base station location can be adjusted dynamically, the best-response dynamics and reinforcement learning algorithm are applied, discussed, and illustrated through numerical results.