2009/11/02 by Alonso Silva, Hamidou Tembine, Silva, Alonso +6
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems #Optimization and Search Problems #cs.GT
paper · pdf · doi:10.48550/arxiv.0911.0257
Part of this work has been presented at the 49th IEEE Conference on Decision and Control 2010. This work has been submitted to IEEE Transactions on Automatic Control
openalex publication_date 2009/11/02 · arxiv created 2011/06/09 · arxiv updated 2011/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The basic optimal transportation problem consists in finding the most effective way of moving masses from one location to another, while minimizing the transportation cost. Such concept has been found to be useful to understand various mathematical, economical, and control theory phenomena, such as Witsenhausen's counterexam-ple in stochastic control theory, principal-agent problem in microeco- nomic theory, location and planning problems, etc. In this work, we focus on mobile association problems: the determina-tion of the cells corresponding to each base station, i.e., the locations at which intelligent mobile terminals prefer to connect to a given base station rather than to others. This work combines game theory and optimal transport theory to characterize the solution based on fluid approximations. We characterize the optimal solution from both the global network and the mobile user points of view.