"Almost-stable" matchings in the Hospitals / Residents problem with Couples
- Submitting institution
-
University of Glasgow
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11-02532
- Type
- D - Journal article
- DOI
-
10.1007/s10601-016-9249-7
- Title of journal
- Constraints
- Article number
- -
- First page
- 50
- Volume
- 22
- Issue
- 1
- ISSN
- 1383-7133
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2017
- URL
-
http://eprints.gla.ac.uk/121248/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- ORIGINALITY: Presents the first algorithms for finding “as stable as possible” matchings in the Hospitals / Residents problem with Couples (HRC). Empirical study over 28,000 instances shows novel result that all optimal matchings found are very close to being stable. SIGNIFICANCE: HRC has applications to centralised allocation of doctors to hospitals, where matchings that are “as stable as possible” are a fundamental solution concept. RIGOUR: Complexity results and algorithm correctness are proved mathematically in the paper and supplementary material. Won Distinguished Paper award at CP 2016; one of 4 from 154 submissions invited for publication in this special journal issue.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -