Designing Matching Mechanisms under General Distributional Constraints
研究了在遗传性约束（如区域配额和多样性约束）下的匹配问题，提出自适应延迟接受机制（ADA），满足学生的策略防护性、非浪费性和较弱的公平性，并提供了在违反遗传性时（如最低配额）的应用方法。
To handle various applications, we study matching under constraints. The only requirement on the constraints is heredity; given a feasible matching, any matching with fewer students at each school is also feasible. Heredity subsumes existing constraints such as regional maximum quotas and diversity constraints. With constraints, there may not exist a matching that satisfies fairness and nonwastefulness (i.e., stability). We demonstrate our new mechanism, the Adaptive Deferred Acceptance mechanism (ADA), satisfies strategy-proofness for students, nonwastefulness, and a weaker fairness property. We also offer a technique to apply ADA even if heredity is violated (e.g., minimum quotas).