Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/159845
Title: Reward optimization for content providers with mobile data subsidization: a hierarchical game approach
Authors: Xiong, Zehui
Zhao, Jun
Niyato, Dusit
Deng, Ruilong
Zhang, Junshan
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Source: Xiong, Z., Zhao, J., Niyato, D., Deng, R. & Zhang, J. (2020). Reward optimization for content providers with mobile data subsidization: a hierarchical game approach. IEEE Transactions On Network Science and Engineering, 7(4), 2363-2377. https://dx.doi.org/10.1109/TNSE.2020.3016963
Project: RG128/18 
RG115/19
RT07/19
RT01/19
MOE2019-T2-1-176
NSoE DeST-SCI2019-0007
NRF2017EWT-EP003-041
NRF2015-NRF-ISF001-2277
RGANS1906
M4082187 (4080) 
RG16/20
Journal: IEEE Transactions on Network Science and Engineering
Abstract: 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.
URI: https://hdl.handle.net/10356/159845
ISSN: 2327-4697
DOI: 10.1109/TNSE.2020.3016963
Rights: © 2020 IEEE. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

SCOPUSTM   
Citations 20

4
Updated on Jul 11, 2022

PublonsTM
Citations 20

3
Updated on Jul 5, 2022

Page view(s)

16
Updated on Aug 18, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.