English

Matching with Committee Preferences

Computer Science and Game Theory 2026-03-05 v2

Abstract

We study a many-to-one matching model inspired by school choice, where schools evaluate applicants using multiple rankings rather than a single priority order. We model each school's evaluation with social choice criteria to reflect the school's internal ranking process. In particular, we define acceptable choices as candidates ranked above a top percentile of the accepted cohort by a sufficient number of evaluators. Stability is then defined in terms of acceptability: accepted candidates must receive strong support, while rejected candidates receive at most weak support. Since exact acceptability and stability may not exist, we construct approximately stable outcomes using a new equilibrium concept that combines matching with a Lindahl equilibrium over ordinal preferences, providing a flexible, equilibrium-based framework for committee-based matching markets.

Keywords

Cite

@article{arxiv.2602.19009,
  title  = {Matching with Committee Preferences},
  author = {Haoyu Song and Thanh Nguyen and Young-san Lin},
  journal= {arXiv preprint arXiv:2602.19009},
  year   = {2026}
}
R2 v1 2026-07-01T10:45:59.760Z