On the complexity of robust stable marriage

DOI10.1007/978-3-319-71147-8_30zbMath1425.91343arXiv1709.06172OpenAlexW2963687312MaRDI QIDQ1708637

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

Publication date: 26 March 2018

Full work available at URL: https://arxiv.org/abs/1709.06172

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)

Related Items (2)

Complexity study for the robust stable marriage problem ⋮ Unnamed Item

This page was built for publication: On the complexity of robust stable marriage