Market Design for Priority-Based Assignment with Distributional Objectives

Published on ● Video Link: https://www.youtube.com/watch?v=En4g8cbSi9E



Duration: 34:08
122 views
2


Atila Abdulkadiroglu (Duke University)
https://simons.berkeley.edu/talks/atila-abdulkadiroglu-duke-university-2023-10-26
Online and Matching-Based Market Design

Scarce resources are commonly rationed based on priorities. Equity is achieved by imposing distributional constraints. In this paper, we provide an axiomatic approach for meeting distributional objectives and respecting priorities. First, we look at a single school's problem of admitting a subset of its applicants. We characterize a general class of choice rules where distributional objectives are met through type-specific reserves and quotas. We show that a particular rule, which we call the regular reserves-and-quotas rule, uniquely minimizes priority violations in this class. Then, we analyze a general setup with multiple schools. We show that when all schools apply the regular reserves-and-quotas rule, the outcome of the Deferred Acceptance mechanism minimizes priority violations in a large class of assignments that satisfy the distributional constraints.







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Online and Matching-Based Market Design
Atila Abdulkadiroglu