254 22 650 3 3840 document 650 README.txt text/plain 1ec579e49290e1708d327ce1114958a9 MD5 2561 2016-03-16 15:45:10 https://researchdata.gla.ac.uk/254/3/README.txt 254 3 2 text/plain Text en public cc_by_4

README.txt

readme 652 2 3857 document 652 SEA2014_instances.zip application/x-zip 20fb4d5680b3808bb7f780b4cdb4d8d5 MD5 873659360 2016-03-16 16:45:46 https://researchdata.gla.ac.uk/254/4/SEA2014_instances.zip 254 4 4 application/x-zip Mixed en public cc_by_4

SEA2014_instances.zip

data 698 1 4011 document 698 indexcodes.txt text/plain c8b44809c8eedc4acc6aaf91435c461b MD5 645 2016-03-24 10:37:42 https://researchdata.gla.ac.uk/254/5/indexcodes.txt 254 5 5 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/650 http://eprints.org/relation/isVolatileVersionOf https://researchdata.gla.ac.uk/id/document/650 http://eprints.org/relation/isIndexCodesVersionOf https://researchdata.gla.ac.uk/id/document/650 archive 6975 disk0/00/00/02/54 2016-01-20 13:43:53 2025-06-05 12:09:32 2016-01-20 13:43:53 data_collection show Biro Peter Institute of Economics, Research Centre for Economic and Regional Studies, Hungarian Academy of Sciences, H-1112, Budaörsi út 45, Budapest, Hungary Manlove David 3976 0000-0001-6754-7308 McBride Iain 21584 glaresearchdata:2014-06-29-254 pub 30200000 The Hospitals / Residents problem with Couples (hrc) is a generalisation of the classical Hospitals / Residents problem (hr) that is important in practical applications because it models the case where couples submit joint preference lists over pairs of (typically geographically close) hospitals. In this paper we give a new NP-completeness result for the problem of deciding whether a stable matching exists, in highly restricted instances of hrc, and also an inapproximability bound for finding a matching with the minimum number of blocking pairs in equally restricted instances of hrc. Further, we present a full description of the first Integer Programming model for finding a maximum cardinality stable matching in an instance of hrc and we describe empirical results when this model applied to randomly generated instances of hrc. 2014-06-29 published University of Glasgow 10.5525/gla.researchdata.254 Model 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 FALSE English http://dx.doi.org/10.1007/978-3-319-07959-2_2 article 2034-04-30 R Check date of last access and update retention schedule accordingly. 2024-06-03 AA: Original Retention date 2024-06-29. Extended to 10 years from last access date. FALSE FALSE http://eprints.gla.ac.uk/id/eprint/97774