TY - GEN
T1 - Stable matchings with diversity constraints
T2 - 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
AU - Chen, Jiehua
AU - Ganian, Robert
AU - Hamm, Thekla
N1 - Publisher Copyright:
© 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-DIVERSE): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, and the colleges each have a total capacity as well as quotas for individual types (the diversity constraints), is there a matching satisfying all diversity constraints such that no unmatched student-college pair has an incentive to deviate? SMTI-DIVERSE is known to be NP-hard. However, as opposed to the NP-membership claims in the literature [Aziz et al., 2019; Huang, 2010], we prove that it is beyond NP: it is complete for the complexity class SP2. In addition, we provide a comprehensive analysis of the problem's complexity from the viewpoint of natural restrictions to inputs and obtain new algorithms for the problem.
AB - We investigate the following many-to-one stable matching problem with diversity constraints (SMTI-DIVERSE): Given a set of students and a set of colleges which have preferences over each other, where the students have overlapping types, and the colleges each have a total capacity as well as quotas for individual types (the diversity constraints), is there a matching satisfying all diversity constraints such that no unmatched student-college pair has an incentive to deviate? SMTI-DIVERSE is known to be NP-hard. However, as opposed to the NP-membership claims in the literature [Aziz et al., 2019; Huang, 2010], we prove that it is beyond NP: it is complete for the complexity class SP2. In addition, we provide a comprehensive analysis of the problem's complexity from the viewpoint of natural restrictions to inputs and obtain new algorithms for the problem.
UR - http://www.scopus.com/inward/record.url?scp=85097353325&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85097353325
T3 - IJCAI International Joint Conference on Artificial Intelligence
SP - 146
EP - 152
BT - Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
A2 - Bessiere, Christian
PB - International Joint Conferences on Artificial Intelligence
Y2 - 1 January 2021
ER -
