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 条
  • [1] Truthful Mechanism for Crowdsourcing Task Assignment
    Qin, Haiyan
    Zhang, Yonglong
    Li, Bin
    2017 IEEE 10TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD), 2017, : 520 - 527
  • [2] Truthful Mechanism for Crowdsourcing Task Assignment
    Yonglong Zhang
    Haiyan Qin
    Bin Li
    Jin Wang
    Sungyoung Lee
    Zhiqiu Huang
    TsinghuaScienceandTechnology, 2018, 23 (06) : 645 - 659
  • [3] Truthful Mechanism for Crowdsourcing Task Assignment
    Zhang, Yonglong
    Qin, Haiyan
    Li, Bin
    Wang, Jin
    Lee, Sungyoung
    Huang, Zhiqiu
    TSINGHUA SCIENCE AND TECHNOLOGY, 2018, 23 (06) : 645 - 659
  • [4] SRA: Secure Reverse Auction for Task Assignment in Spatial Crowdsourcing
    Xiao, Mingjun
    Ma, Kai
    Liu, An
    Zhao, Hui
    Li, Zhixu
    Zheng, Kai
    Zhou, Xiaofang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2020, 32 (04) : 782 - 796
  • [5] Suitability-based Task Assignment in Crowdsourcing Markets
    Wang, Pengwei
    Chen, Zhen
    Zhang, Zhaohui
    2020 IEEE 13TH INTERNATIONAL CONFERENCE ON SERVICES COMPUTING (SCC 2020), 2020, : 361 - 369
  • [6] Task Routing and Assignment in Crowdsourcing based on Cognitive Abilities
    Goncalves, Jorge
    Feldman, Michael
    Hu, Subingqian
    Kostakos, Vassilis
    Bernstein, Abraham
    WWW'17 COMPANION: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2017, : 1023 - 1031
  • [7] TCAM: A Truthful Combinatorial Auction Mechanism for Crowdsourcing Systems
    Cui, Jingmei
    Sun, Yu-E
    Huang, He
    Guo, Hansong
    Du, Yang
    Yang, Wenjian
    Li, Meixuan
    2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2018,
  • [8] A Reliable Task Assignment Strategy for Spatial Crowdsourcing in Big Data Environment
    Gu, Liqiu
    Wang, Kun
    Liu, Xiulong
    Guo, Song
    Liu, Bo
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [9] A Stable Task Assignment Scheme in Crowdsourcing
    Chen, Xiao
    2019 22ND IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (IEEE CSE 2019) AND 17TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (IEEE EUC 2019), 2019, : 489 - 494
  • [10] A High Quality Task Assignment Mechanism in Vehicle-Based Crowdsourcing Using Predictable Mobility Based on Markov
    Jia, Bing
    Xu, Haotian
    Liu, Shuai
    Li, Wuyungerile
    IEEE ACCESS, 2018, 6 : 64920 - 64926