303 21 769 2 4331 document 769 MIN_BP_HRC_Experiments.zip application/x-zip 464e09c11d2cd28c45e66cc15cf52ccb MD5 43144374 2016-04-18 08:44:54 https://researchdata.gla.ac.uk/303/1/MIN_BP_HRC_Experiments.zip 303 1 1 application/x-zip Text en public cc_by_4

MIN_BP_HRC_Experiments.zip

data 770 3 4333 document 770 README.txt text/plain ce649d3418f21b68dc78cef55f69dd65 MD5 2145 2016-04-18 08:45:04 https://researchdata.gla.ac.uk/303/2/README.txt 303 2 2 text/plain Text en public cc_by_4

README.txt

readme 771 1 4344 document 771 indexcodes.txt text/plain eac3703ee80a718cb0e1df4e1596cc11 MD5 514 2016-04-18 08:50:10 https://researchdata.gla.ac.uk/303/3/indexcodes.txt 303 3 3 text/plain other Generate index codes conversion from Text to indexcodes en public

indexcodes.txt

http://eprints.org/relation/isVersionOf https://researchdata.gla.ac.uk/id/document/770 http://eprints.org/relation/isVolatileVersionOf https://researchdata.gla.ac.uk/id/document/770 http://eprints.org/relation/isIndexCodesVersionOf https://researchdata.gla.ac.uk/id/document/770 archive 6975 disk0/00/00/03/03 2016-04-18 08:45:36 2026-04-07 08:39:05 2016-04-18 08:54:53 data_collection show Manlove David 3976 0000-0001-6754-7308 McBride Iain Trimble James 33678 glaresearchdata:2016-04-18-303 30200000 The Hospitals / Residents problem with Couples (hrc) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider min bp hrc, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is “as stable as possible”). We show that this problem is NP-hard and difficult to approximate even if each couple finds only one hospital pair acceptable. However if we further assume that the preference list of each single resident and hospital is of length at most 2, we give a polynomial-time algorithm for this case. We then show how to adapt an earlier Integer Programming (IP) model for hrc to yield an IP formulation for min bp hrc. Finally, we discuss an empirical evaluation of the IP model applied to randomly-generated instances of min bp hrc. Our main finding is that the number of blocking pairs admitted by a solution is very small, i.e., usually at most 1, and never more than 2, for the (28,000) instances considered. 2016-04-18 submitted University of Glasgow 10.5525/gla.researchdata.303 Text University of Glasgow 60707 1 Efficient Algorithms for Mechanism Design Without Monetary Transfer. David Manlove Engineering & Physical Sciences Research Council (EPSRC) EP/K010042/1 COM - COMPUTING SCIENCE 70843 1 EPSRC: Institutional Sponsorship 2015 - University of Glasgow Miles Padgett Engineering & Physical Sciences Research Council (EPSRC) EP/N508792/1 VICE PRINCIPAL RESEARCH & ENTERPRISE FALSE English http://arxiv.org/abs/1602.01956 article 2036-03-31 R 2026-04-07 AA Original retention date 2026-04-18. Extended to 10 years from date of last access. FALSE FALSE http://eprints.gla.ac.uk/id/eprint/121248