A Local Search Algorithm for SMTI and its extension to HRT Problems

Danny Munera (1) , Daniel Diaz (1) , Salvador Abreu (2) , Francesca Rossi (3) , Vijay Saraswat (4) , Philippe Codognet (5, 6)

1 CRI - Centre de Recherche en Informatique de Paris 1
2 Universidade de Évora
3 Unipd - Università degli Studi di Padova = University of Padua
4 IBM Thomas J. Watson Research Center
5 JFLI - Japanese French Laboratory for Informatics
6 UPMC - Université Pierre et Marie Curie - Paris 6

Hospitals/Residents with Ties (HRT) forms a class of problems with many applications, some of which are of considerable size. Solving these problems has been shown to be NP-hard. In previous work, we developed a local search algorithm which displays very high performance in solving Stable Matching with Ties and Incomplete lists (SMTI) problems. In this paper, we propose a method to tackle HRT problems with a slightly modified version of our SMTI solver. We describe our method and provide an initial performance assessment, which turns out to show that the resulting solver can deal with significant HRT problems, providing optimal solutions in most cases, in a very short time.

Domains: Distributed, Parallel, and Cluster Computing [cs.DC]

Danny Munera, Daniel Diaz, Salvador Abreu, Francesca Rossi, Vijay Saraswat, et al.. A Local Search Algorithm for SMTI and its extension to HRT Problems. 3rd International Workshop on Matching Under Preferences, University of Glasgow, Apr 2015, Glasgow, United Kingdom. ⟨hal-01144208⟩