arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.09678cs.LG
收藏

学习匹配

Learning to Match

Chalmers University of Technology(查尔姆斯理工大学);University of Lille(里尔大学);Harvard University(哈佛大学)

Philip Ekman, Sebastian Bellevik, Christos Dimitrakakis, Aristide Tossou

摘要:

将任务外包给以前不为人知的各方变得越来越普遍。一个具体的这样的问题涉及到匹配一组工人的一组任务。即使后者有确切的要求,个别工人的素质通常是未知的。因此,这个问题是不确定性下的匹配问题。我们认为,这类问题将变得越来越重要。当问题只涉及单一技能或工作类型时,它本质上是一种强盗问题,可以用标准算法解决。然而,我们开发了一种算法,可以为具有多种技能的工人进行匹配,这些工人被雇用来从事具有多种要求的多个工作。我们在单任务和多任务的问题进行了实验评估,与有界$ε$ -第一算法,以及一个先知,知道工人的真正技能相比。我们开发的算法之一给出的结果接近85%的Oracle的性能。我们邀请社区更仔细地研究这个问题,并制定现实世界的基准。

英文摘要:

Outsourcing tasks to previously unknown parties is becoming more common. One specific such problem involves matching a set of workers to a set of tasks. Even if the latter have precise requirements, the quality of individual workers is usually unknown. The problem is thus a version of matching under uncertainty. We believe that this type of problem is going to be increasingly important. When the problem involves only a single skill or type of job, it is essentially a type of bandit problem, and can be solved with standard algorithms. However, we develop an algorithm that can perform matching for workers with multiple skills hired for multiple jobs with multiple requirements. We perform an experimental evaluation in both single-task and multi-task problems, comparing with the bounded $ε$-first algorithm, as well as an oracle that knows the true skills of workers. One of the algorithms we developed gives results approaching 85\% of oracle's performance. We invite the community to take a closer look at this problem and develop real-world benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑