边学习边匹配
Matching while Learning
摘要:
我们考虑的问题所面临的服务平台,需要匹配有限的供应与需求,但也要学习新用户的属性,以便在未来更好地匹配他们。我们引入了一个基准模型与异质的“工人”(需求)和有限的供应“工作”,随着时间的推移到达。作业类型对于平台是已知的,但工作者类型是未知的,必须通过观察匹配结果来学习。工人在完成一定数量的工作后离开。一场比赛的预期收益取决于两种类型,目标是最大化收益的稳态累积率。虽然我们使用的术语是受劳动力市场的启发,但我们的框架更广泛地适用于随着时间的推移,将有限的异构产品供应与用户相匹配的平台。我们的主要贡献是一个完整的表征结构的最优策略的限制,每个工人执行许多工作。对于每个工人来说,平台都面临着一个权衡:短视地最大化收益(剥削)和学习工人的类型(探索)。这就产生了大量的多臂强盗问题,每个工人一个,通过对不同类型工作的可用性的约束(能力约束)耦合在一起。我们发现,平台应该为每种工作类型估计一个影子价格,并使用这些价格调整后的收益,首先,确定其学习目标,然后,对于每个工人,(i)在“探索阶段”平衡学习与收益,(ii)在“开发阶段”实现学习目标后进行近视匹配。"
英文摘要:
We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous "workers" (demand) and a limited supply of "jobs" that arrive over time. Job types are known to the platform, but worker types are unknown and must be learned by observing match outcomes. Workers depart after performing a certain number of jobs. The expected payoff from a match depends on the pair of types and the goal is to maximize the steady-state rate of accumulation of payoff. Though we use terminology inspired by labor markets, our framework applies more broadly to platforms where a limited supply of heterogeneous products is matched to users over time. Our main contribution is a complete characterization of the structure of the optimal policy in the limit that each worker performs many jobs. The platform faces a trade-off for each worker between myopically maximizing payoffs (exploitation) and learning the type of the worker (exploration). This creates a multitude of multi-armed bandit problems, one for each worker, coupled together by the constraint on availability of jobs of different types (capacity constraints). We find that the platform should estimate a shadow price for each job type, and use the payoffs adjusted by these prices, first, to determine its learning goals and then, for each worker, (i) to balance learning with payoffs during the "exploration phase," and (ii) to myopically match after it has achieved its learning goals during the "exploitation phase."
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。