Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization

Abstract : Stable matching problems have several practical applications. If preference lists are truncated and contain ties, finding a stable matching with maximal size is computationally difficult. We address this problem using a local search technique, based on Adaptive Search and present experimental evidence that this approach is much more efficient than state-of-the-art exact and approximate methods. Moreover, parallel versions (particularly versions with communication) improve performance so much that very large and hard instances can be solved quickly.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal-paris1.archives-ouvertes.fr/hal-01144214
Contributor : Danny Munera <>
Submitted on : Tuesday, April 21, 2015 - 11:25:59 AM
Last modification on : Friday, May 24, 2019 - 4:12:32 PM
Long-term archiving on : Wednesday, April 19, 2017 - 1:12:18 AM

File

SMTI-AAAI15-NC.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01144214, version 1

Citation

Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, et al.. Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization. 29th AAAI Conference on Artificial Intelligence, Jan 2015, Austin, TX, United States. ⟨hal-01144214⟩

Share

Metrics

Record views

302

Files downloads

265