Spatial Games and Global Optimization for Mobile Association Problems

The basic optimal transportation problem consists in finding the most effective way of moving masses from one location to the other, 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 counterexample in stochastic control theory, principal-agent problem in microeconomic theory, location and planning problems, etc. In this paper, the authors focus on mobile association problems: the determination 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.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Jun 2011 Format: PDF

Find By Topic