Publication
AAAI/IAAI 2015
Conference paper

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.

Date

01 Jun 2015

Publication

AAAI/IAAI 2015

Authors

Share