结合结果与偏好的匹配:一种约束优先机制
Combining Outcome-Based and Preference-Based Matching: A Constrained Priority Mechanism
摘要:
我们引入了一个受约束的优先级机制,结合基于结果的匹配,从机器学习与基于偏好的分配方案在市场设计中常见。使用真实世界的数据,我们说明了我们的机制可以应用到分配的难民家庭东道国的位置,和学校的志愿者。我们的机制允许规划者首先指定一个阈值$\bar g$的最低可接受的平均结果分数,应该实现的分配。在难民匹配的情况下,这个分数对应于就业的预测概率,而在学生分配的情况下,它对应于标准化的考试成绩。该机制是一个优先机制,既考虑结果,也考虑偏好,根据代理人(难民家庭、学生)的偏好进行分配,但须符合规划者规定的门槛。该机制是战略证明和约束有效的,因为它总是产生一个匹配,这是不帕累托主导的任何其他匹配,尊重规划者的阈值。
英文摘要:
We introduce a constrained priority mechanism that combines outcome-based matching from machine-learning with preference-based allocation schemes common in market design. Using real-world data, we illustrate how our mechanism could be applied to the assignment of refugee families to host country locations, and kindergarteners to schools. Our mechanism allows a planner to first specify a threshold $\bar g$ for the minimum acceptable average outcome score that should be achieved by the assignment. In the refugee matching context, this score corresponds to the predicted probability of employment, while in the student assignment context it corresponds to standardized test scores. The mechanism is a priority mechanism that considers both outcomes and preferences by assigning agents (refugee families, students) based on their preferences, but subject to meeting the planner's specified threshold. The mechanism is both strategy-proof and constrained efficient in that it always generates a matching that is not Pareto dominated by any other matching that respects the planner's threshold.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。