3D-online Stable Matching Problem for New Spatial Crowdsourcing Platforms
Author:
Affiliation:

Clc Number:

Fund Project:

National Key Research and Development Program of China (2016YFC1401900); National Natural Science Foundation of China (U1811262, 61902023, 61932004, 61572119, 61622202, 61672145, 61732003, 61572121, 61972077); Fundamental Research Funds for the Central Universities (N181605012, N171604007); China Postdoctoral Science General Program Foundation (2018M631358)

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In recent years, spatial crowdsourcing platforms attract more and more attention. One of the core issues is to assign proper workers to users to finish their tasks under the temporal and spatial constraints. Most existing works aim to maximize the number of tasks that are finished or the sum of utility score. These approaches ignore the preference of users and workers. Moreover, existing works usually only focus on two roles, workers and users. Workers travel to the location of users to finish the tasks. However, new spatial crowdsourcing platforms contain three types of roles, workers, users, and workplaces. The platforms assign workplaces for workers and users to finish the tasks. Thus, the stable matching problem in the three-dimensional platforms is proposed to solve the static scenarios. However, most spatial crowdsourcing platforms are online scenarios. Workers and tasks issued by the users appear in real time. Therefore, a three-dimensional online stable matching problem is formalized in new spatial crowdsourcing platforms. A baseline algorithm and an improved algorithm are proposed which benefit from the advantages of artificial intelligence to solve this problem. Finally, extensive experiments are conducted on real datasets and synthetic datasets to verify the efficiency and effectiveness of the proposed algorithms.

    Reference
    Related
    Cited by
Get Citation

李博扬,成雨蓉,王国仁,袁野,孙永佼.新型时空众包平台中的在线三维稳定匹配问题.软件学报,2020,31(12):3836-3851

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 22,2015
  • Revised:August 11,2015
  • Adopted:
  • Online: December 03,2020
  • Published: December 06,2020
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063