Reserve Matching with Thresholds
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909917942644736 |
|---|---|
| author | Evren, Suat |
| author_facet | Evren, Suat |
| contents | We develop a general framework for reserve systems that allocate scarce resources such as vaccines to unit-demand agents under prioritization and eligibility constraints, along with a computationally efficient mechanism. Reserve systems allocate scarce resources --such as vaccines, medical units, school seats, or government positions-- to essential groups by creating categories with prioritized beneficiaries. Prior work typically assumed a common baseline priority ordering and featured either hard or soft reserves. The threshold reserve model we introduce supports independent priority orderings, mixtures of hard and soft reserves, and overlapping categories, thereby capturing both beneficiary designations and eligibility constraints while offering policymakers greater flexibility. Our Iterative Max-in-Max Assignment Mechanism (IMMAM) satisfies all desirable properties in this domain: it respects priorities within categories, maximizes resource utilization, and then lexicographically maximizes beneficiary assignments. IMMAM is path independent and therefore well-behaved in settings with multiple institutions making simultaneous allocation decisions. We leverage path independence to obtain comparative statics and to significantly improve the mechanism's computational efficiency. We outline applications of our framework in the context of vaccine allocation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_13766 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Reserve Matching with Thresholds Evren, Suat Theoretical Economics Data Structures and Algorithms F.2; G.2.1; J.4 We develop a general framework for reserve systems that allocate scarce resources such as vaccines to unit-demand agents under prioritization and eligibility constraints, along with a computationally efficient mechanism. Reserve systems allocate scarce resources --such as vaccines, medical units, school seats, or government positions-- to essential groups by creating categories with prioritized beneficiaries. Prior work typically assumed a common baseline priority ordering and featured either hard or soft reserves. The threshold reserve model we introduce supports independent priority orderings, mixtures of hard and soft reserves, and overlapping categories, thereby capturing both beneficiary designations and eligibility constraints while offering policymakers greater flexibility. Our Iterative Max-in-Max Assignment Mechanism (IMMAM) satisfies all desirable properties in this domain: it respects priorities within categories, maximizes resource utilization, and then lexicographically maximizes beneficiary assignments. IMMAM is path independent and therefore well-behaved in settings with multiple institutions making simultaneous allocation decisions. We leverage path independence to obtain comparative statics and to significantly improve the mechanism's computational efficiency. We outline applications of our framework in the context of vaccine allocation. |
| title | Reserve Matching with Thresholds |
| topic | Theoretical Economics Data Structures and Algorithms F.2; G.2.1; J.4 |
| url | https://arxiv.org/abs/2309.13766 |