DATA: A Double Auction Based Task Assignment Mechanism in Crowdsourcing Systems

被引:0
|
作者
Xu, Wei [1 ]
Huang, He [1 ]
Sun, Yu-e
Li, Fanzhang [1 ]
Zhu, Yanqin [1 ]
Zhang, Shukui [1 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China
来源
2013 8TH INTERNATIONAL ICST CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM) | 2013年
基金
中国国家自然科学基金;
关键词
Double auction; Truthful; Task assignment; Mobile sensing; Crowdsourcing;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the increasing number of smartphone users, mobile phone sensing applications have been regarding as a promising paradigm which makes use of the smartphones to access the ubiquitous environment data. In this work, we study the sensing task auction problem where there are multiple tasks and smartphone users. The most significant challenge of this problem is how to design a truthful auction mechanisms, which is crucial for auction mechanism design. Thus, we address this challenge by proposing DATA, which is a truthful double auction mechanism for sensing tasks allocation. Different from the existing designs, we are the first to design double auction mechanism for solving mobile phone sensing problem. Besides, we further take the relationship between the utility of task demanders and the number of users that are assigned to do the tasks into consideration, and assign a set of smartphone users to a winning demander which can maximize the winning demander's utility. At last, we conduct extensive simulations to study the performances of the proposed auction mechanism, and the simulation results corroborate our theoretical analysis.
引用
收藏
页码:172 / 177
页数:6
相关论文
共 50 条
  • [21] A Double Auction Mechanism for Task Scheduling of An EOS Constellation
    Feng, Rui
    Lin, Zhiyun
    Wu, Peng
    Han, Zhimin
    Wang, Bo
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2023, 70 (07) : 2490 - 2494
  • [22] Bi-Objective Indirect Optimization of Robotic Transportation Task Assignment Based on Auction Mechanism
    Souleymane, Moussa G.
    M'hammed, Sahnoun
    Fabrice, Duval
    Abdelaziz, Bensrhair
    2020 IEEE ELECTRON DEVICES TECHNOLOGY AND MANUFACTURING CONFERENCE (EDTM 2020), 2020,
  • [23] An Online Task Assignment Based on Quality Constraint for Spatio-Temporal Crowdsourcing
    Pan, Qingxian
    Pan, Tingwei
    Dong, Hongbin
    Wang, Yingjie
    Jiang, Shan
    Yin, Zengxuan
    IEEE ACCESS, 2019, 7 : 170292 - 170303
  • [24] Crowdsourcing usage, task assignment methods, and crowdsourcing platforms: A systematic literature review
    Zhen, Ying
    Khan, Abdullah
    Nazir, Shah
    Huiqi, Zhao
    Alharbi, Abdullah
    Khan, Sulaiman
    JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS, 2021, 33 (08)
  • [25] Quality-Assured Synchronized Task Assignment in Crowdsourcing
    Tu, Jiayang
    Cheng, Peng
    Chen, Lei
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (03) : 1156 - 1168
  • [26] Maximizing user type diversity for task assignment in crowdsourcing
    Wang, Ana
    Ren, Meirui
    Ma, Hailong
    Zhang, Lichen
    Li, Peng
    Guo, Longjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (04) : 1092 - 1120
  • [27] Task Assignment Optimization for Crowdsourcing Using Genetic Algorithm
    Yusoff, Marina
    Ikram, Muhamad Nazreen Shah Bin Mohd
    Janom, Norjansalika
    ADVANCED SCIENCE LETTERS, 2018, 24 (11) : 8205 - 8208
  • [28] Maximizing user type diversity for task assignment in crowdsourcing
    Ana Wang
    Meirui Ren
    Hailong Ma
    Lichen Zhang
    Peng Li
    Longjiang Guo
    Journal of Combinatorial Optimization, 2020, 40 : 1092 - 1120
  • [29] A workload-dependent task assignment policy for crowdsourcing
    Ilio Catallo
    Stefano Coniglio
    Piero Fraternali
    Davide Martinenghi
    World Wide Web, 2017, 20 : 1179 - 1210
  • [30] A workload-dependent task assignment policy for crowdsourcing
    Catallo, Ilio
    Coniglio, Stefano
    Fraternali, Piero
    Martinenghi, Davide
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2017, 20 (06): : 1179 - 1210