太原理工大学学报2024，Vol.55Issue(1)：155-162,8.DOI:10.16355/j.tyut.1007-9432.20220638
时空众包中的多轮跨平台在线匹配
Multi-round Cross Online Matching in Spatial-temporal Crowdsourcing
摘要
Abstract
[Purposes]To address the imbalance between supply and demand in traditional sin-gle platform task assignment,Cross Online Matching(COM)has emerged as a novel solution that allows multiple similar platforms to establish cooperative relationships and send uncompleted tasks to other platforms,increasing the probability of task acceptance.However,current COM solutions only consider single-round matching processes,making it difficult to find optimal deci-sion results in multi-platform competition.To settle these limitations,the Multi-Round Cross Online Matching problem(MRCOM)is studied and Greedy-based Multi-Round Cross Online Matching(G-MRCOM)and Game-Theoretic Multi-Round Cross Online Matching(GT-MR-COM)algorithms are proposed.[Methods]G-MRCOM improves task completion efficiency by forwarding and matching tasks in multiple rounds,with platforms greedily selecting high-reward tasks to accomplish.GT-MRCOM,on the other hand,establishes incentive mechanisms among algorithms cooperating platforms,calculates task assignment strategies that satisfy Nash Equilib-rium,and enables the platform to find better strategies in competition,thereby enhancing overall performance.[Findings]Experimental results demonstrate that the proposed algorithms can in-crease the total revenue of platforms,showcasing the effectiveness and efficiency of this study.关键词
时空众包/任务分配/在线匹配/博弈论/贪心Key words
spatial-temporal crowdsourcing/task assignment/online matching/game theory/greedy分类
信息技术与安全科学引用本文复制引用
金倩倩,李博扬,成雨蓉,孙永佼..时空众包中的多轮跨平台在线匹配[J].太原理工大学学报,2024,55(1):155-162,8.基金项目
国家自然科学基金资助项目(62202046,U21B2007,U21A2051,61972077,62072087) （62202046,U21B2007,U21A2051,61972077,62072087）
辽宁省兴辽英才计划项目(XLYC2007079) （XLYC2007079）
