Stable matching problems with exchange restrictions

Journal of Combinatorial Optimization

Volumn 16, Issue 4 SPEC. ISS., 2008, Pages 344-360

  Irving, Robert W ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Matching; NP complete problems; Stable marriage

Indexed keywords

COMBINATORIAL MATHEMATICS; KETONES; NUCLEAR PROPULSION;

A STABLES; ALGEBRAIC STRUCTURES; CLASSICAL STABLE MARRIAGES; FIXED LENGTHS; LINEAR TIMES; MATCHING; MATCHING SCHEMES; MATCHINGS; NP-COMPLETE PROBLEMS; NP-HARDNESS; PRACTICAL; PREFERENCE LISTS; STABLE MARRIAGE; STABLE MARRIAGES; STABLE MATCHING PROBLEMS;

FARM BUILDINGS;

EID: 54049124662     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9153-1     Document Type: Conference Paper

References (18)

1. J Alcalde 1995 Exchange-proofness or divorce-proofness? Stability in one-sided matching markets Econ Des 1 275 287
2. Allan J (2002) NHS Scotland. Personal communication
3. Carms (2008) The Canadian Resident Matching Scheme. Wb document available at http://www.carms.ca/index.html
4. K Cechlárová 2002 On the complexity of exchange stable roommates Discrete Appl Math 116 279 287
5. K Cechlárová DF Manlove 2005 The exchange-stable marriage problem Discrete Appl Math 152 109 122
6. D Gale LS Shapley 1962 College admissions and the stability of marriage Am Math Mon 69 9 15
7. D Gale M Sotomayor 1985 Some remarks on the stable marriage problem Discrete Appl Math 11 223 232
8. Garey MJ, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
9. D Gusfield 1987 Three fast algorithms for four problems in stable marriage SIAM J Comput 16 111 128
10. Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT Press, Cambridge
11. Irving RW (1998) Matching medical students to pairs of hospitals: a new variation on an old theme. In: Proceedings of ESA'98, the sixth annual european symposium on algorithms, Venice Italy, 1998. LNCS, vol 1461. Springer, Berlin, pp 381-392
12. RW Irving P Leather 1986 The complexity of counting stable marriages SIAM J Comput 15 655 667
13. Knuth DE (1976) Mariages stables. Les Presses du l'Université de Montréal, Montreal
14. E McDermid C Cheng I Suzuki 2007 Hardness results on the man-exchange stable marriage problem with short preference lists Inf Process Lett 101 1 13 19
15. NRMP (2007) National Resident Matching Program. Web document available at http://www.nrmp.org/about_nrmp/how.html
16. AE Roth 1984 The evolution of the labor market for medical interns and residents: a case study in game theory J Polit Econ 92 6 991 1016
17. Schaefer TJ (1978) The complexity of satisfiability problems. In: Proc 10th ann ACM symp on theory of computing. ACM, New York, pp 216-226
18. SFAS (2008) Scottish Foundation Allocation Scheme. Web document available at http://www.nes.scot.nhs.uk/sfas/