TY - JOUR
T1 - Multi-cap optimization for wireless data plans with time flexibility
AU - Wang, Zhiyuan
AU - Gao, Lin
AU - Huang, Jianwei
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2020/9/1
Y1 - 2020/9/1
N2 - An effective way for a Mobile network operator (MNO) to improve its revenue is price discrimination, i.e., providing different combinations of data caps and subscription fees. Rollover data plan (allowing the unused data in the current month to be used in the next month) is an innovative data mechanism with time flexibility. In this paper, we study the MNO's optimal multi-cap data plans with time flexibility in a realistic asymmetric information scenario. Specifically, users are associated with multi-dimensional private information, and the MNO designs a contract (with different data caps and subscription fees) to induce users to truthfully reveal their private information. This problem is quite challenging due to the multi-dimensional private information. We address the challenge in two aspects. First, we find that a feasible contract (satisfying incentive compatibility and individual rationality) should allocate the data caps according to users' willingness-to-pay (captured by the slopes of users' indifference curves). Second, for the non-convex data cap allocation problem, we propose a Dynamic Quota Allocation Algorithm, which has a low complexity and guarantees the global optimality. Numerical results show that the time-flexible data mechanisms increase both the MNO's profit (25 percent on average) and users' payoffs (8.2 percent on average) under price discrimination.
AB - An effective way for a Mobile network operator (MNO) to improve its revenue is price discrimination, i.e., providing different combinations of data caps and subscription fees. Rollover data plan (allowing the unused data in the current month to be used in the next month) is an innovative data mechanism with time flexibility. In this paper, we study the MNO's optimal multi-cap data plans with time flexibility in a realistic asymmetric information scenario. Specifically, users are associated with multi-dimensional private information, and the MNO designs a contract (with different data caps and subscription fees) to induce users to truthfully reveal their private information. This problem is quite challenging due to the multi-dimensional private information. We address the challenge in two aspects. First, we find that a feasible contract (satisfying incentive compatibility and individual rationality) should allocate the data caps according to users' willingness-to-pay (captured by the slopes of users' indifference curves). Second, for the non-convex data cap allocation problem, we propose a Dynamic Quota Allocation Algorithm, which has a low complexity and guarantees the global optimality. Numerical results show that the time-flexible data mechanisms increase both the MNO's profit (25 percent on average) and users' payoffs (8.2 percent on average) under price discrimination.
KW - Price discrimination
KW - multi-dimensional contract
KW - rollover data plan
KW - time flexibility
UR - https://www.scopus.com/pages/publications/85089801731
U2 - 10.1109/TMC.2019.2920878
DO - 10.1109/TMC.2019.2920878
M3 - 文章
AN - SCOPUS:85089801731
SN - 1536-1233
VL - 19
SP - 2145
EP - 2159
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 9
M1 - 8731760
ER -