Truthful Profit Maximization Mechanisms for Mobile Crowdsourcing

被引:1
|
作者
Qiao, Yu [1 ]
Zhang, Jie [1 ]
He, Qiangqiang [1 ]
Gu, Yi [1 ]
Wu, Jun [2 ]
Zhang, Lei [1 ]
Wang, Chongjun [1 ]
机构
[1] Nanjing Univ, Natl Key Lab Novel Software Technol, Nanjing, Peoples R China
[2] Nanjing Univ Finance & Econ, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
Budget control - Computation theory - Crowdsourcing - Game theory;
D O I
10.1155/2022/8859905
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crowdsourcing is an effective tool to allocate tasks among workers to obtain a cumulative outcome. Algorithmic game theory is widely used as a powerful tool to ensure the service quality of a crowdsourcing campaign. By this paper, we consider a more general optimization objective for the budget-free crowdsourcer, profit maximization, where profit is defined as the difference between the benefit obtained by crowdsourcer and payments to workers. Based on the framework of random sampling and profit extraction, we proposed a strategy-proof profit-oriented mechanism for our problem, which also satisfies computational tractability and individual rationality and has a performance guarantee. We also extend the profit extract algorithm to the online case through a two-stage sampling. Also, we study the setting in which workers are not trusted, and untrustworthy workers would infer others' true type. For untrustworthy workers, we introduce a differentially private mechanism, which also has desired properties. Finally, we will conduct numerical simulations to show the effectiveness of our proposed profit maximization mechanisms. By this work, we enrich the class of competitive auctions by considering a more general optimization objective and a more general demand valuation function.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Profit Maximization in Mobile Crowdsourcing: A Truthful Auction Mechanism
    Shah-Mansouri, Hamed
    Wong, Vincent W. S.
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2015, : 3216 - 3221
  • [2] Profit Maximization in Mobile Crowdsourcing: A Competitive Analysis
    Li, Qi
    Cai, Lijun
    Xu, Huanle
    Meng, Tao
    [J]. IEEE ACCESS, 2021, 9 : 27827 - 27839
  • [3] Task allocation based on profit maximization for mobile crowdsourcing
    Yinglin, Hou
    Weiqing, Cheng
    [J]. Journal of China Universities of Posts and Telecommunications, 2020, 27 (01): : 26 - 37
  • [4] Task allocation based on profit maximization for mobile crowdsourcing
    Hou Yinglin
    Cheng Weiqing
    [J]. The Journal of China Universities of Posts and Telecommunications, 2020, 27 (01) : 26 - 37
  • [5] Towards Truthful Mechanisms for Mobile Crowdsourcing with Dynamic Smartphones
    Feng, Zhenni
    Zhu, Yanmin
    Zhang, Qian
    Zhu, Hongzi
    Yu, Jiadi
    Cao, Jian
    Ni, Lionel M.
    [J]. 2014 IEEE 34TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2014), 2014, : 11 - 20
  • [6] Truthful Incentive Mechanisms for Dynamic and Heterogeneous Tasks in Mobile Crowdsourcing
    Fan, Yue
    Sun, Hailong
    Liu, Xudong
    [J]. 2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015), 2015, : 881 - 888
  • [7] Truthful Incentive Mechanisms for Crowdsourcing
    Zhang, Xiang
    Xue, Guoliang
    Yu, Ruozhou
    Yang, Dejun
    Tang, Jian
    [J]. 2015 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), 2015,
  • [8] Truthful Incentive Mechanisms for Social Cost Minimization in Mobile Crowdsourcing Systems
    Duan, Zhuojun
    Yan, Mingyuan
    Cai, Zhipeng
    Wang, Xiaoming
    Han, Meng
    Li, Yingshu
    [J]. SENSORS, 2016, 16 (04)
  • [9] Truthful Interval Cover Mechanisms for Crowdsourcing Applications
    Dayama, Pankaj
    Narayanaswamy, Balakrishnan
    Garg, Dinesh
    Narahari, Y.
    [J]. PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1091 - 1099
  • [10] A Tractable Truthful Profit Maximization Mechanism Design With Autonomous Agents
    Montazeri, Mina
    Kebriaei, Hamed
    Araabi, Babak N.
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (08) : 5439 - 5445