Strategy proof matching with minimum quotas and initial endowments

Naoto Hamada, Ryoji Kurata, Suguru Ueda, Takamasa Suzuki, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationAAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1349-1350
Number of pages2
ISBN (Electronic)9781450342391
Publication statusPublished - Jan 1 2016
Event15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 - Singapore, Singapore
Duration: May 9 2016May 13 2016

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Other

Other15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016
CountrySingapore
CitySingapore
Period5/9/165/13/16

Fingerprint

Students

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Cite this

Hamada, N., Kurata, R., Ueda, S., Suzuki, T., & Yokoo, M. (2016). Strategy proof matching with minimum quotas and initial endowments. In AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1349-1350). (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

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 proceedingConference contribution

Hamada, N, Kurata, R, Ueda, S, Suzuki, T & Yokoo, M 2016, Strategy proof matching with minimum quotas and initial endowments. in AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), pp. 1349-1350, 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016, Singapore, Singapore, 5/9/16.
Hamada N, Kurata R, Ueda S, Suzuki T, Yokoo M. Strategy proof matching with minimum quotas and initial endowments. In 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).
Hamada, Naoto ; Kurata, Ryoji ; Ueda, Suguru ; Suzuki, Takamasa ; Yokoo, Makoto. / Strategy proof matching with minimum quotas and initial endowments. AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2016. pp. 1349-1350 (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).
@inproceedings{982885459e3d4fa5a13014b2748518c1,
title = "Strategy proof matching with minimum quotas and initial endowments",
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.",
author = "Naoto Hamada and Ryoji Kurata and Suguru Ueda and Takamasa Suzuki and Makoto Yokoo",
year = "2016",
month = "1",
day = "1",
language = "English",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "1349--1350",
booktitle = "AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems",

}

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 -