当前位置: X-MOL 学术IEEE Trans. Netw. Sci. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Reward Optimization for Content Providers With Mobile Data Subsidization: A Hierarchical Game Approach
IEEE Transactions on Network Science and Engineering ( IF 6.6 ) Pub Date : 2020-08-17 , DOI: 10.1109/tnse.2020.3016963
Zehui Xiong , Jun Zhao , Dusit Niyato , Ruilong Deng , Junshan Zhang

Mobile data subsidization launched by mobile network operators is a promising business model to provide economic benefits for the mobile data market and beyond. It allows content providers to partly subsidize mobile data consumption of mobile users in exchange for displaying a certain amount of advertisements. From a content provider perspective, it is of great interest to determine the optimal strategy for offering appropriate data subsidization (reward) in order to compete against others to earn more revenue and gain higher profit. In this paper, we take a hierarchical game approach to model the reward optimization process for the content providers. To analyze the relationship between the provider and the user, we first focus on the one-to-one interaction in a single-provider single-user system, and formulate a Mathematical Program with Equilibrium Constraints (MPEC). We apply the backward induction to solve the MPEC problem and prove the existence and uniqueness of the Stackelberg equilibrium. We then formulate an Equilibrium Program with Equilibrium Constraints (EPEC) to characterize the many-to-many interactions among multiple providers and multiple users. Considering the inherent high complexity of the EPEC problem, we utilize the distributed Alternating Direction Method of Multipliers (ADMM) algorithm to obtain the optimum solutions with fast-convergence and decomposition properties of ADMM.

中文翻译:

带有移动数据补贴的内容提供商的奖励优化:一种分层博弈方法

由移动网络运营商发起的移动数据补贴是一种有前途的商业模式,可以为移动数据市场及其他市场提供经济利益。它允许内容提供商部分补贴移动用户的移动数据消费,以换取显示一定数量的广告。从内容提供商的角度来看,确定提供适当的数据补贴(奖励)以与他人竞争以获得更多收入和更高利润的最佳策略非常重要。在本文中,我们采用分级博弈的方法来为内容提供商建模奖励优化过程。为了分析提供商与用户之间的关系,我们首先关注单一提供商单用户系统中的一对一交互,并制定了具有平衡约束的数学程序(MPEC)。我们应用向后归纳法来解决MPEC问题,并证明Stackelberg均衡的存在性和唯一性。然后,我们制定具有均衡约束(EPEC)的均衡程序,以表征多个提供商和多个用户之间的多对多交互。考虑到EPEC问题固有的高复杂性,我们利用分布式乘数交替方向法(ADMM)算法来获得具有ADMM快速收敛和分解特性的最优解。然后,我们制定具有均衡约束(EPEC)的均衡程序,以表征多个提供商和多个用户之间的多对多交互。考虑到EPEC问题固有的高复杂性,我们利用分布式乘数交替方向法(ADMM)算法来获得具有ADMM快速收敛和分解特性的最优解。然后,我们制定具有均衡约束(EPEC)的均衡程序,以表征多个提供商和多个用户之间的多对多交互。考虑到EPEC问题固有的高复杂性,我们利用分布式乘数交替方向法(ADMM)算法来获得具有ADMM快速收敛和分解特性的最优解。
更新日期:2020-08-17
down
wechat
bug