The University of Southampton
University of Southampton Institutional Repository

Solving hard stable matching problems involving groups of similar agents

Solving hard stable matching problems involving groups of similar agents
Solving hard stable matching problems involving groups of similar agents
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.
Meeks, Kitty
d068f6a9-2e17-4337-b1e8-d93141225713
Rastegari, Baharak
6ba9e93c-53ba-4090-8f77-c1cb1568d7d1
Meeks, Kitty
d068f6a9-2e17-4337-b1e8-d93141225713
Rastegari, Baharak
6ba9e93c-53ba-4090-8f77-c1cb1568d7d1

Meeks, Kitty and Rastegari, Baharak (2017) Solving hard stable matching problems involving groups of similar agents. arXiv. (Submitted)

Record type: Article

Abstract

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.

Text
1708.04109 - Author's Original
Download (357kB)

More information

Submitted date: 14 August 2017

Identifiers

Local EPrints ID: 425880
URI: https://eprints.soton.ac.uk/id/eprint/425880
PURE UUID: 9b4f6873-b810-4808-9c83-b256238ed657
ORCID for Baharak Rastegari: ORCID iD orcid.org/0000-0002-0985-573X

Catalogue record

Date deposited: 06 Nov 2018 17:30
Last modified: 14 Mar 2019 01:20

Export record

Contributors

Author: Kitty Meeks
Author: Baharak Rastegari ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×