Solving Hard Stable Matching Problems Involving Groups of Similar Agents

08/14/2017
by   Kitty Meeks, et al.
0

Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify simple structural properties of instances of stable matching problems which will allow the design of efficient algorithms. We focus on the setting in which all agents involved in some matching problem can be partitioned into k different types, where the type of an agent determines his or her preferences, and agents have preferences over types (which may be refined by more detailed preferences within a single type). This situation could arise in practice if agents form preferences based on some small collection of agents' attributes. The notion of types could also be used if we are interested in a relaxation of stability, in which agents will only form a private arrangement if it allows them to be matched with a partner who differs from the current partner in some particularly important characteristic. We show that in this setting several well-studied NP-hard stable matching problems (such as MAX SMTI, MAX SRTI, and MAX SIZE MIN BP SMTI) belong to the parameterised complexity class FPT when parameterised by the number of different types of agents, and so admit efficient algorithms when this number of types is small.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2019

Stable Roommates with Narcissistic, Single-Peaked, and Single-Crossing Preferences

The classical Stable Roommates problem asks whether it is possible to ha...
research
01/12/2021

Stable Matchings with Flexible Quotas

We consider the problem of assigning agents to programs in the presence ...
research
03/26/2018

Min-Max Tours for Task Allocation to Heterogeneous Agents

We consider a scenario consisting of a set of heterogeneous mobile agent...
research
01/29/2022

Fair Stable Matching Meets Correlated Preferences

The stable matching problem sets the economic foundation of several prac...
research
10/14/2022

Popularity on the Roommate Diversity Problem

A recently introduced restricted variant of the multidimensional stable ...
research
01/27/2020

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

We investigate the following many-to-one stable matching problem with di...
research
08/19/2020

Stable Matchings with Restricted Preferences: Structure and Complexity

It is well known that every stable matching instance I has a rotation po...

Please sign up or login with your details

Forgot password? Click here to reset