Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

01/27/2020
by   Jiehua Chen, et al.
0

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., AAMAS 2019; Huang, SODA 2010], we prove that it is beyond NP: it is complete for the complexity class Σ^P_2. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2023

Optimal Capacity Modification for Many-To-One Matching Problems

We consider many-to-one matching problems, where one side consists of st...
research
02/17/2020

From Matching with Diversity Constraints to Matching with Regional Quotas

In the past few years, several new matching models have been proposed an...
research
04/08/2018

A 3/2-approximation algorithm for the Student-Project Allocation problem

The Student-Project Allocation problem with lecturer preferences over St...
research
02/19/2023

Matching Algorithms under Diversity-Based Reservations

Selection under category or diversity constraints is a ubiquitous and wi...
research
08/14/2017

Solving Hard Stable Matching Problems Involving Groups of Similar Agents

Many important stable matching problems are known to be NP-hard, even wh...
research
06/28/2019

Stable Matchings in Divorce Graphs

In this paper, we study the Reaching Stable Marriage via Divorce Operati...
research
08/27/2018

The Complexity of Student-Project-Resource Matching-Allocation Problems

In this technical note, I settle the computational complexity of nonwast...

Please sign up or login with your details

Forgot password? Click here to reset