Solving Hard Stable Matching Problems via Local Search and Cooperative Parallelization - Université Paris 1 Panthéon-Sorbonne Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
SMTI-AAAI15-NC.pdf (254.96 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01144214 , version 1 (21-04-2015)

Identifiers

  • HAL Id : hal-01144214 , version 1

Cite

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⟩
231 View
457 Download

Share

Gmail Mastodon Facebook X LinkedIn More