EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1209. Stable Matching with Contingent Priorities
Invited abstract in session WA-43: Market Design 2, stream Market Design.
Wednesday, 8:30-10:00Room: 99 (building: 306)
Authors (first author is the speaker)
| 1. | Ignacio Rios
|
| University of Texas at Dallas |
Abstract
We study stable matching problems under contingent priorities, whereby the clearinghouse prioritizes some agents based on the allocation of others. Using school choice as a motivating example, we first introduce a stylized model of a many-to-one matching market where the clearinghouse aims to prioritize applicants with siblings assigned to the same school and match them together. We provide a series of guidelines to implement these contingent priorities and introduce two novel concepts of stability that account for them. We study some properties of the corresponding mechanisms, including the existence of a stable assignment under contingent priorities, its incentive properties, and the complexity of finding one if it exists. Moreover, we provide mathematical programming formulations to find such stable assignments whenever they exist. Finally, using data from the Chilean school choice system, we show that our framework can significantly increase the number of siblings assigned together while having no large effect on students without siblings.
Keywords
- Optimization Modeling
- Practice of OR
- Programming, Integer
Status: accepted
Back to the list of papers