Robust stable marriage

Begum Genc; Mohamed Siala; Barry O'Sullivan; Gilles Simonin

Robust stable marriage

Begum Genc
, Mohamed Siala
, Barry O'Sullivan
, Gilles Simonin

Research output: Contribution to conference › Paper › peer-review

Abstract

Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments. We propose a new version of SM called as Robust Stable Marriage (RSM) by combining stability and robustness. We define robustness by introducing (a,b)-supermatches, which has been inspired by (a, b)-supermodels (Ginsberg, Parkes, and Roy 1998). An (a, b)-supermatch is a stable matching, where if at most a pairs want to break up, it is possible to find another stable matching by breaking at most b other pairs.

Original language	English
Pages	4925-4926
Number of pages	2
Publication status	Published - 2017
Event	31st AAAI Conference on Artificial Intelligence, AAAI 2017 - San Francisco, United States Duration: 4 Feb 2017 → 10 Feb 2017

Conference

Conference	31st AAAI Conference on Artificial Intelligence, AAAI 2017
Country/Territory	United States
City	San Francisco
Period	4/02/17 → 10/02/17

Cite this

@conference{8c69bafc1f1d4d998e33004225935a68,

title = "Robust stable marriage",

abstract = "Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments. We propose a new version of SM called as Robust Stable Marriage (RSM) by combining stability and robustness. We define robustness by introducing (a,b)-supermatches, which has been inspired by (a, b)-supermodels (Ginsberg, Parkes, and Roy 1998). An (a, b)-supermatch is a stable matching, where if at most a pairs want to break up, it is possible to find another stable matching by breaking at most b other pairs.",

author = "Begum Genc and Mohamed Siala and Barry O'Sullivan and Gilles Simonin",

note = "Publisher Copyright: {\textcopyright} Copyright 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 31st AAAI Conference on Artificial Intelligence, AAAI 2017 ; Conference date: 04-02-2017 Through 10-02-2017",

year = "2017",

language = "English",

pages = "4925--4926",

}

TY - CONF

T1 - Robust stable marriage

AU - Genc, Begum

AU - Siala, Mohamed

AU - O'Sullivan, Barry

AU - Simonin, Gilles

PY - 2017

Y1 - 2017

N2 - Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments. We propose a new version of SM called as Robust Stable Marriage (RSM) by combining stability and robustness. We define robustness by introducing (a,b)-supermatches, which has been inspired by (a, b)-supermodels (Ginsberg, Parkes, and Roy 1998). An (a, b)-supermatch is a stable matching, where if at most a pairs want to break up, it is possible to find another stable matching by breaking at most b other pairs.

AB - Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments. We propose a new version of SM called as Robust Stable Marriage (RSM) by combining stability and robustness. We define robustness by introducing (a,b)-supermatches, which has been inspired by (a, b)-supermodels (Ginsberg, Parkes, and Roy 1998). An (a, b)-supermatch is a stable matching, where if at most a pairs want to break up, it is possible to find another stable matching by breaking at most b other pairs.

UR - https://www.scopus.com/pages/publications/85030473951

M3 - Paper

AN - SCOPUS:85030473951

SP - 4925

EP - 4926

T2 - 31st AAAI Conference on Artificial Intelligence, AAAI 2017

Y2 - 4 February 2017 through 10 February 2017

ER -

Robust stable marriage

Abstract

Conference

Other files and links

Fingerprint

Cite this