Theoretical design of decentralized auction framework under mobile crowdsourcing environment

被引:7
作者
Guo, Jianxiong [1 ,2 ]
Ding, Xingjian [3 ]
Wang, Tian [1 ,2 ]
Jia, Weijia [1 ,2 ]
机构
[1] Beijing Normal Univ, Adv Inst Nat Sci, Zhuhai 519087, Peoples R China
[2] BNU HKBU United Int Coll, Guangdong Key Lab AI & Multimodal Data Proc, Zhuhai 519087, Peoples R China
[3] Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Decentralization; Incentive mechanism; Auction theory; Utility maximization; Truthfulness; TRUTHFUL INCENTIVE MECHANISM; BLOCKCHAIN;
D O I
10.1016/j.tcs.2022.10.030
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the rapid popularization of mobile devices, the mobile crowdsourcing has become a hot topic in order to make full use of the resources of mobile devices. To achieve this goal, it is necessary to design an excellent incentive mechanism to encourage more mobile users to actively undertake crowdsourcing tasks, so as to achieve maximization of certain economic indicators. However, most of the reported incentive mechanisms in the existing literature adopt a centralized platform, which collects the bidding information from workers and task requesters. There is a risk of privacy exposure. In this paper, we design a decentralized auction framework where mobile workers are sellers and task requesters are buyers. This requires each participant to make its own local and independent decision, thereby avoiding centralized processing of task allocation and pricing. Both of them aim to maximize their utilities under the budget constraint. We theoretically prove that our proposed framework is individual rational, budget balanced, truthful, and computationally efficient, and then we conduct a group of numerical simulations to demonstrate its correctness and effectiveness.(c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:250 / 260
页数:11
相关论文
共 35 条
[1]   Differentially Private Double Spectrum Auction With Approximate Social Welfare Maximization [J].
Chen, Zhili ;
Ni, Tianjiao ;
Zhong, Hong ;
Zhang, Shun ;
Cui, Jie .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2019, 14 (11) :2805-2818
[2]   FROG: A Fast and Reliable Crowdsourcing Framework [J].
Cheng, Peng ;
Lian, Xiang ;
Jian, Xun ;
Chen, Lei .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) :894-908
[3]   An Incentive Mechanism for Building a Secure Blockchain-Based Internet of Things [J].
Ding, Xingjian ;
Guo, Jianxiong ;
Li, Deying ;
Wu, Weili .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (01) :477-487
[4]   Distributed Auctions for Task Assignment and Scheduling in Mobile Crowdsensing Systems [J].
Duan, Zhuojun ;
Li, Wei ;
Cai, Zhipeng .
2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017), 2017, :635-644
[5]   Truthful Incentive Mechanism for Nondeterministic Crowdsensing with Vehicles [J].
Gao, Guoju ;
Xiao, Mingjun ;
Wu, Jie ;
Huang, Liusheng ;
Hu, Chang .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2018, 17 (12) :2982-2997
[6]   A Mobile-assisted Edge Computing Framework for Emerging IoT Applications [J].
Guo, Deke ;
Gu, Siyuan ;
Xie, Junjie ;
Luo, Lailong ;
Luo, Xueshan ;
Chen, Yingwen .
ACM TRANSACTIONS ON SENSOR NETWORKS, 2021, 17 (04)
[7]  
Guo Jianxiong, 2022, Algorithmic Aspects in Information and Management: 16th International Conference, AAIM 2022, Proceedings. Lecture Notes in Computer Science (13513), P207, DOI 10.1007/978-3-031-16081-3_18
[8]   Combinatorial resources auction in decentralized edge-thing systems using blockchain and differential privacy [J].
Guo, Jianxiong ;
Ding, Xingjian ;
Wang, Tian ;
Jia, Weijia .
INFORMATION SCIENCES, 2022, 607 :211-229
[9]   Reliable Traffic Monitoring Mechanisms Based on Blockchain in Vehicular Networks [J].
Guo, Jianxiong ;
Ding, Xingjian ;
Wu, Weili .
IEEE TRANSACTIONS ON RELIABILITY, 2022, 71 (03) :1219-1229
[10]   A Blockchain-Enabled Ecosystem for Distributed Electricity Trading in Smart City [J].
Guo, Jianxiong ;
Ding, Xingjian ;
Wu, Weili .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (03) :2040-2050