Dynamic User Recruitment with Truthful Pricing for Mobile CrowdSensing
Wenbin Liu, Yongjian Yang, En Wang, Jie Wu
Abstract
Mobile CrowdSensing (MCS) is a promising paradigm that recruits users to cooperatively perform various sensing tasks. In most realistic scenarios, users dynamically participate in MCS, and hence, we should recruit them in an online manner. In general, we prefer to recruit a user who can make the maximum contribution at the least cost, especially when the recruitment budget is limited. The existing strategies usually formulate the user recruitment as the budgeted optimal stopping problem, while we argue that not only the budget but also the time constraints can greatly influence the recruitment performance. For example, if we have less remaining budget but plenty of time, we should recruit users with more patience. In this paper, we propose a dynamic user recruitment strategy with truthful pricing to address the online recruitment problem under the budget and time constraints. To deal with the two constraints, we first estimate the number of users to be recruited and then recruit them in segments. Furthermore, to correct estimation errors and utilize newly obtained information, we dynamically re-adjust the recruiting strategy and also prove that the proposed strategy achieves a competitive ratio of (1 - 1/e)2/7. Finally, a reverse auction-based online pricing mechanism is lightly built into the proposed user recruitment strategy, which achieves truthfulness and individual rationality. Extensive experiments on three real-world data sets validate the proposed online user recruitment strategy, which can effectively improve the number of completed tasks under the budget and time constraints.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 98aa49d6-ea01-4d1c-9514-24580010efaeCited by top-tier papers3
- Privacy-Preserving Online Task Assignment in Spatial Crowdsourcing: A Graph-based ApproachHengzhi Wang, En Wang, Yongjian Yang, Jie Wu et al.INFOCOM 2022 · 57 citations
- Minimizing Entropy for Crowdsourcing with Combinatorial Multi-Armed BanditYiwen Song, Haiming JinINFOCOM 2021 · 25 citations
- Crowdsensing Data Trading based on Combinatorial Multi-Armed Bandit and Stackelberg GameBaoyi An, Mingjun Xiao, An Liu, Xike Xie et al.ICDE 2021 · 25 citations
Related papers
- Combinatorial Multi-Armed Bandit Based Unknown Worker Recruitment in Heterogeneous CrowdsensingGuoju Gao, Jie Wu, Mingjun Xiao, Guoliang ChenINFOCOM 2020 · 90 citations
- Worker Selection Towards Data Completion for Online Sparse CrowdsensingWenbin Liu, En Wang, Yongjian Yang, Jie WuINFOCOM 2022 · 30 citations
- Age-of-Information-Aware Mobile Crowdsensing for Uncertain Event CaptureJinrui Zhou, Yin Xu, Haotian Xu, Mingjun Xiao et al.INFOCOM 2026
- Task Execution Quality Maximization for Mobile Crowdsourcing in Geo-Social NetworksLiang Wang, Zhiwen Yu, Dingqi Yang, Tian Wang et al.CSCW 2021 · 4 citations
- Wisdom of Crowds: A Human-Machine-Things Cooperative Scheduling Method for Heterogeneous Mobile CrowdsensingYimeng Liu, Zhiwen Yu, Fengyuan Zhang, Helei Cui et al.CSCW 2024 · 2 citations
