An approach to robustness in the stable roommates problem and its comparison with the stable marriage problem

DOI10.1007/978-3-030-19212-9_21MaRDI QIDQ2327262zbMATH OpenOpenAlexFDO

Authors Mohamed Siala, G. Simonin, Barry O'Sullivan, Begum Genc

Publication date 14 October 2019

Full work available at URL https://hal.laas.fr/hal-02062127/file/19-CPAIOR.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Complexity study for the robust stable marriage problem
• On the complexity of robust stable marriage
• Stability against robust deviations in the roommate problem
• The Stable Roommates Problem with Ties
• Efficient algorithms for generalized stable marriage and roommates problems

Cited in

(4)

• On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
• Finding stable matchings that are robust to errors in the input
• A General Framework for Stable Roommates Problems using Answer Set Programming
• Efficient algorithms for generalized stable marriage and roommates problems

This page was built for publication: An approach to robustness in the stable roommates problem and its comparison with the stable marriage problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327262)