Stable matching with uncertain linear preferences
From MaRDI portal
Publication:2309477
DOI10.1007/s00453-019-00650-0zbMath1435.91123arXiv1607.02917WikidataQ90667602 ScholiaQ90667602MaRDI QIDQ2309477
Serge Gaspers, Péter Biró, Haris Aziz, Baharak Rastegari, Nicholas Mattei, Ronald de Haan
Publication date: 1 April 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.02917
stable matchings; stable marriage problem; polynomial-time algorithms; NP-hard problems; uncertain preferences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
91B68: Matching models
Uses Software