Trading privacy with incentives in mobile commerce: A game theoretic approach

被引:20
作者
Chorppath, Anil Kumar [1 ]
Alpcan, Tansu [2 ]
机构
[1] Tech Univ Munich, Lehrstuhl Theoret Informationstech, D-80333 Munich, Germany
[2] Univ Melbourne, Dept Elect & Elect Engn, Melbourne, Vic 3010, Australia
关键词
Game theory; Mobile commerce; Privacy; Mechanism design; Information theoretic metrics;
D O I
10.1016/j.pmcj.2012.07.011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In mobile commerce, companies provide location based services to mobile users, who report their locations with a certain level of granularity to maintain a degree of anonymity. This level of granularity depends on their perceived risk as well as the incentives they receive in the form of monetary benefits or improved mobile services. This paper formulates a quantitative model in which information theoretic metrics such as entropy, quantify the anonymity level of mobile users. The individual perceived risks of users and the benefits they obtain are defined as functions of their chosen location information granularity. The interaction between the mobile commerce company and its users is investigated using mechanism design techniques as a privacy game. The user best responses and optimal strategies for the company are derived under budgetary constraints on incentives, which are provided to users in order to convince them to share their private information at the desired level of granularity. Information limitations in the system are analyzed to capture more realistic scenarios where the companies do not have access to user utility functions. Iterative distributed algorithm and regression learning methods are investigated to design mechanisms that overcome these limitations. The results obtained are demonstrated with a numerical example and simulations based on real GPS data. (C) 2012 Elsevier B. V. All rights reserved.
引用
收藏
页码:598 / 612
页数:15
相关论文
共 21 条
[1]  
Alpcan T., P INT C GAM THEOR NE
[2]  
[Anonymous], 2011, GOVTS NOT READY NEW
[3]   Reducing mechanism design to algorithm design via machine learning [J].
Balcan, Maria-Florina ;
Blum, Avrim ;
Hartline, Jason D. ;
Mansour, Yishay .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (08) :1245-1270
[4]  
Basar T, 1998, Dynamic Noncooperative Game Theory
[5]  
Bertsekas D. P., 1997, Parallel and Distributed Computation: Numerical Methods
[6]   Balancing transport and physical layers in wireless multihop networks: Jointly optimal congestion control and power control [J].
Chiang, M .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (01) :104-116
[7]  
Chorppath A.K., P 50 IEEE C DEC CONT
[8]  
Dekel O, 2008, PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P884
[9]  
Hajiaghayi Mohammad Taghi, 2004, P 5 ACM C EL COMM EC, P71
[10]  
Himmel M., 2005, METHOD SYSTEM SCHEDU