Quality-Aware Pricing for Mobile Crowdsensing

被引:51
作者
Han, Kai [1 ]
Huang, He [2 ]
Luo, Jun [3 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Suzhou Inst Adv Study, Hefei 230026, Anhui, Peoples R China
[2] Soochow Univ, Sch Comp Sci & Technol, Suzhou 215000, Peoples R China
[3] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
基金
中国国家自然科学基金;
关键词
Crowdsourcing; approximation algorithms; INCENTIVE MECHANISMS; BUDGET; TASKS;
D O I
10.1109/TNET.2018.2846569
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile crowdsensing has been considered as a promising approach for large scale urban data collection, but has also posed new challenging problems, such as incentivization and quality control. Among the other incentivization approaches, posted pricing has been widely adopted by commercial systems due to the reason that it naturally achieves truthfulness and fairness and is easy to be implemented. However, the fundamental problem of how to set the "right" posted prices in crowdsensing systems remains largely open. In this paper, we study a quality-aware pricing problem for mobile crowdsensing, and our goal is to choose an appropriate posted price to recruit a group of participants with reasonable sensing qualities for robust crowdsensing, while the total expected payment is minimized. We show that our problem is NP-hard and has close ties with the well-known Poisson binomial distributions (PBDs). To tackle our problem, we first discover some non-trivial submodular properties of PBD, which have not been reported before, and then propose a novel "ironing method" that transforms our problem from a non-submodular optimization problem into a submodular one by leveraging the newly discovered properties of PBD. Finally, with the ironing method, several approximation algorithms with provable performance ratios are provided, and we also conduct extensive numerical experiments to demonstrate the effectiveness of our approach.
引用
收藏
页码:1728 / 1741
页数:14
相关论文
共 45 条
  • [1] Acharya Jayadev., 2015, Proceedings of SODA, P1829, DOI DOI 10.1137/1.9781611973730.122
  • [2] [Anonymous], 2013, Proceedings of the 22nd WWW
  • [3] [Anonymous], 2015, ACM MobiHoc, DOI DOI 10.1145/2746285.2746306
  • [4] [Anonymous], 2017, P 18 ACM INT S MOB A
  • [5] Bayesian Budget Feasibility with Posted Pricing
    Balkanski, Eric
    Hartline, Jason D.
    [J]. PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16), 2016, : 189 - 203
  • [6] Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
    Bubeck, Sebastien
    Cesa-Bianchi, Nicolo
    [J]. FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01): : 1 - 122
  • [7] Carlton DennisW., 2005, Modern Industrial Organisation, V4th
  • [8] Cavallo R., 2012, P INT C AUT AG MULT, P677
  • [9] On the Structure, Covering, and Learning of Poisson Multinomial Distributions
    Daskalakis, Constantinos
    Kamath, Gautam
    Tzamos, Christos
    [J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1203 - 1217
  • [10] Learning Poisson Binomial Distributions
    Daskalakis, Constantinos
    Diakonikolas, Ilias
    Servedio, Rocco A.
    [J]. ALGORITHMICA, 2015, 72 (01) : 316 - 357