Abstract
Although minimum quotas are important in many real-world markets, existing strategy proof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategy proof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student considers (at least) one particular school, which we call her initial endowment school, acceptable, and vice-versa, and (ii) the initial endowments satisfy all the minimum quotas. We require a matching to respect initial endowments; each student must be assigned to a school that is at least as good as her initial endowment. PLDA-MQ obtains the student-optimal matching within all matchings that respect minimum quotas/initial endowments and satisfies a stability requirement called Priority-List based (PL-) stability.
| Original language | English |
|---|---|
| Title of host publication | AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems |
| Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |
| Pages | 1349-1350 |
| Number of pages | 2 |
| ISBN (Electronic) | 9781450342391 |
| Publication status | Published - Jan 1 2016 |
| Event | 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 - Singapore, Singapore Duration: May 9 2016 → May 13 2016 |
Publication series
| Name | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
|---|---|
| ISSN (Print) | 1548-8403 |
| ISSN (Electronic) | 1558-2914 |
Other
| Other | 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 |
|---|---|
| Country | Singapore |
| City | Singapore |
| Period | 5/9/16 → 5/13/16 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Software
- Control and Systems Engineering
Cite this
Strategy proof matching with minimum quotas and initial endowments. / Hamada, Naoto; Kurata, Ryoji; Ueda, Suguru; Suzuki, Takamasa; Yokoo, Makoto.
AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2016. p. 1349-1350 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Strategy proof matching with minimum quotas and initial endowments
AU - Hamada, Naoto
AU - Kurata, Ryoji
AU - Ueda, Suguru
AU - Suzuki, Takamasa
AU - Yokoo, Makoto
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Although minimum quotas are important in many real-world markets, existing strategy proof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategy proof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student considers (at least) one particular school, which we call her initial endowment school, acceptable, and vice-versa, and (ii) the initial endowments satisfy all the minimum quotas. We require a matching to respect initial endowments; each student must be assigned to a school that is at least as good as her initial endowment. PLDA-MQ obtains the student-optimal matching within all matchings that respect minimum quotas/initial endowments and satisfies a stability requirement called Priority-List based (PL-) stability.
AB - Although minimum quotas are important in many real-world markets, existing strategy proof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategy proof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student considers (at least) one particular school, which we call her initial endowment school, acceptable, and vice-versa, and (ii) the initial endowments satisfy all the minimum quotas. We require a matching to respect initial endowments; each student must be assigned to a school that is at least as good as her initial endowment. PLDA-MQ obtains the student-optimal matching within all matchings that respect minimum quotas/initial endowments and satisfies a stability requirement called Priority-List based (PL-) stability.
UR - http://www.scopus.com/inward/record.url?scp=85014154207&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85014154207&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85014154207
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1349
EP - 1350
BT - AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
ER -