Local search for stable marriage problems with ties and incomplete lists

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6230 LNAI, Issue , 2010, Pages 64-75

  Gelain, Mirco ^a   Pini, Maria Silvia ^a   Rossi, Francesca ^a   Venable, Kristen Brent ^a   Walsh, Toby ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL MOVES; LOCAL SEARCH; MATCHINGS; NP-HARD; OPTIMAL SIZE; PREFERENCE LISTS; STABLE MARRIAGE PROBLEM; STABLE MATCHING; TWO-SIDED MARKETS;

PROBLEM SOLVING;

EID: 78049262533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15246-7_9     Document Type: Conference Paper

References (12)

1. Gusfield, D., Irving, R. W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)
2. Gale, D., Shapley, L. S.: College admissions and the stability of marriage. The American Mathematical Monthly 69(1), 9-15 (1962)
3. Manlove, D., Irving, R. W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276 (1-2), 261-279 (2002) (Pubitemid 34295614)
4. Gent, I. P., Prosser, P.: An empirical study of the stable marriage problem with ties and incomplete lists. In: ECAI, pp. 141-145 (2002)
5. Gent, I. P., Prosser, P.: Sat encodings of the stable marriage problem with ties and incomplete lists. In: SAT 2002, pp. 133-140 (2002)
6. Yanagisawa: Approximation algorithms for stable marriage problems. PhD thesis, Kyoto University, Graduate School of Informatics (2007)
7. McDermid, E.: A 3/2-approximation algorithm for general stable marriage. In: Albers, S., et al. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 689-700. Springer, Heidelberg (2009)
8. Iwama, K., Manlove, D., Miyazaki, S., Morita, Y.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443-452. Springer, Heidelberg (1999)
9. Holger, H., Hoos, E. T.: Local search methods. In: Rossi, F., Beek, P. V., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)
10. Stutzle, T. G.: Local Search Algorithms for Combinatorial Problems - Analysis, Improvements, and New Applications. PhD thesis, Am Fachbereich Informatik der Technischen Universitat Darmstadt (1998)
11. Hoos, H.: On the run-time behaviour of stochastic local search algorithms for sat. In: Proc. AAAI 1999, pp. 661-666 (1999)
12. Roth, A. E., Vate, J. H. V.: Random paths to stability in two-sided matching. Econometrica 58(6), 1475-1480 (1990)