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
N1 - Funding Information:
This work was partially supported by JSPS KAKENHI Grant Number 24220003 and 15K16058.
Publisher Copyright:
Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
PY - 2016
Y1 - 2016
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)
T2 - 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016
Y2 - 9 May 2016 through 13 May 2016
ER -