Designing Random Allocation Mechanisms: Theory and Applications
推广了随机分配理论，处理多单位分配和现实约束（如学校选择的群体配额、课程分配的时间表限制），设计了事前有效且公平的新机制，并开发了限制事后不公平的“效用保证”技术。
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized assignment to accommodate multi-unit allocations and various real-world constraints, such as group-specific quotas (“controlled choice”) in school choice and house allocation, and scheduling and curriculum constraints in course allocation. We develop new mechanisms that are ex ante efficient and fair in these environments, and that incorporate certain non-additive substitutable preferences. We also develop a “utility guarantee” technique that limits ex post unfairness in random allocations, supplementing the ex ante fairness promoted by randomization. This can be applied to multi-unit assignment problems and certain two-sided matching problems.