The classical optimal transportation problem entails finding the most cost-effective way of moving masses from one set of locations to another, minimizing its transportation cost. The formulation of this problem and its solution have been useful to understand various mathematical, economic, and control theory phenomena, such as Witsenhausen’s counterexample in stochastic control theory, the principal-agent problem in microeconomic theory, and location and planning problems. The main difficulty is that one has to deal with optimization in infinite dimensions (the space of probability measures with transport constraints).

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

User-Base Station Association in Next-Generation Networks

  • Tamer Başar,
  • Boualem Djehiche,
  • Hamidou Tembine

摘要

The classical optimal transportation problem entails finding the most cost-effective way of moving masses from one set of locations to another, minimizing its transportation cost. The formulation of this problem and its solution have been useful to understand various mathematical, economic, and control theory phenomena, such as Witsenhausen’s counterexample in stochastic control theory, the principal-agent problem in microeconomic theory, and location and planning problems. The main difficulty is that one has to deal with optimization in infinite dimensions (the space of probability measures with transport constraints).