空间众包中预算感知的在线任务分配
Budget-aware Online Task Assignment in Spatial Crowdsourcing
摘要:
移动互联网技术的普及刺激了各种空间众包应用的出现。某些应用程序服务于请求者,预算提供者,他们向平台提交一批任务和固定预算,希望寻找合适的工作人员来完成最大数量的任务。平台注重优化分配策略,寻求消耗较少资源的工作者-任务对,以满足请求者的需求。现有的预算约束下的任务分配研究主要集中在静态离线场景,其中所有工人和任务的时空信息是预先已知的。然而,工人通常出现在真实的空间众包平台,现有的解决方案很难处理它。在本文中,我们正式定义了一个新的问题预算感知的在线任务分配(BOA)在空间众包应用。BOA的目标是在预算约束下最大化分配的工人-任务对的数量,其中工人动态地出现在平台上。为了解决BOA问题,我们首先提出了一个有效的基于阈值的贪心算法Greedy-RT,它利用一个随机生成的阈值,以修剪对大旅行成本。与简单贪心算法相比,Greedy-RT算法在敌手模型下表现较好,但在随机模型下不稳定,因为其随机生成的阈值可能导致匹配质量较差。然后,我们提出了一种改进的算法Greedy-OT,它可以从历史数据中学习近似最优阈值,从而显着提高了两种模型的匹配大小。最后,通过在真实数据集和人工数据集上的大量实验,验证了所提方法的有效性和高效性。
英文摘要:
The prevalence of mobile internet techniques stimulates the emergence of various spatial crowdsourcing applications. Certain of the applications serve for requesters, budget providers, who submit a batch of tasks and a fixed budget to platform with the desire to search suitable workers to complete the tasks in maximum quantity. Platform lays stress on optimizing assignment strategies on seeking less budget-consumed worker-task pairs to meet requesters' demands. Existing research on the task assignment with budget constraint mostly focuses on static offline scenarios, where the spatiotemporal information of all workers and tasks is known in advance. However, workers usually appear dynamically on real spatial crowdsourcing platforms, where existing solutions can hardly handle it. In this paper, we formally define a novel problem Budget-aware Online task Assignment(BOA) in spatial crowdsourcing applications. BOA aims to maximize the number of assigned worker- task pairs under a budget constraint where workers appear dynamically on platforms. To address the BOA problem, we first propose an efficient threshold-based greedy algorithm Greedy-RT which utilizes a random generated threshold to prune the pairs with large travel cost. Greedy-RT performs well in adversary model when compared with simple greedy algorithm, but it is unstable in random model for its randomly generated threshold may produce poor quality in matching size. We then propose a revised algorithm Greedy-OT which could learn approximately optimal threshold from historical data, and consequently improves matching size significantly in both models. Finally, we verify the effectiveness and efficiency of the proposed methods through extensive experiments on real and synthetic datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。