Robust Stable Marriage

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

AAAI 2017 pp. 4925-4926

doi:10.1609/AAAI.V31I1.11107 /aaai/2017/genc2017aaai-robust/

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. 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.

PDF AAAI Semantic Scholar

Cite

Text

Genc et al. "Robust Stable Marriage." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.11107

Markdown

[Genc et al. "Robust Stable Marriage." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/genc2017aaai-robust/) doi:10.1609/AAAI.V31I1.11107

BibTeX

@inproceedings{genc2017aaai-robust,
  title     = {{Robust Stable Marriage}},
  author    = {Genc, Begum and Siala, Mohamed and O'Sullivan, Barry and Simonin, Gilles},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {4925-4926},
  doi       = {10.1609/AAAI.V31I1.11107},
  url       = {https://mlanthology.org/aaai/2017/genc2017aaai-robust/}
}