分布约束下的稳定项目分配
Stable project allocation under distributional constraints
摘要：
在双边匹配市场中，当双方的代理人都有偏好时，解决方案的稳定性通常是最重要的要求。然而，我们也可能在受让人的最低数目或受让人按其类型的分布方面面临一些分布上的限制。这两个要求在实践中可能难以协调。在本文中，我们描述了两个实际应用，一个项目分配问题和车间分配问题，都涉及到一些分布约束。我们使用整数规划技术，找到合理的好的解决方案的稳定性和分布约束。我们的方法可以在各种不同的应用程序，如居民分配与较低的配额，控制学校选择或大学录取与平权行动是有用的。
英文摘要：
In a two-sided matching market when agents on both sides have preferences the stability of the solution is typically the most important requirement. However, we may also face some distributional constraints with regard to the minimum number of assignees or the distribution of the assignees according to their types. These two requirements can be challenging to reconcile in practice. In this paper we describe two real applications, a project allocation problem and a workshop assignment problem, both involving some distributional constraints. We used integer programming techniques to find reasonably good solutions with regard to the stability and the distributional constraints. Our approach can be useful in a variety of different applications, such as resident allocation with lower quotas, controlled school choice or college admissions with affirmative action.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
