Designing matching mechanisms under general distributional constraints

Masahiro Goto, Fuhito Kojima, Ryoji Kurata, Akihisa Tamura, Makoto Yokoo

Research output: Contribution to journalArticlepeer-review

33 Citations (Scopus)


To handle various applications, we study matching under constraints. The only requirement on the constraints is heredity; given a feasible matching, any matching with fewer students at each school is also feasible. Heredity subsumes existing constraints such as regional maximum quotas and diversity constraints. With constraints, there may not exist a matching that satisfies fairness and nonwastefulness (i.e., stability). We demonstrate our new mechanism, the Adaptive Deferred Acceptance mechanism (ADA), satisfies strategy-proofness for students, nonwastefulness, and a weaker fairness property. We also offer a technique to apply ADA even if heredity is violated (e.g., minimum quotas).

Original languageEnglish
Pages (from-to)226-262
Number of pages37
JournalAmerican Economic Journal: Microeconomics
Issue number2
Publication statusPublished - May 1 2017

All Science Journal Classification (ASJC) codes

  • Economics, Econometrics and Finance(all)


Dive into the research topics of 'Designing matching mechanisms under general distributional constraints'. Together they form a unique fingerprint.

Cite this