244 22 444 2 2843 document 444 README.txt text/plain 2f8e766ba07b85a490431e5535eef65a MD5 1717 2015-12-22 16:02:00 https://researchdata.gla.ac.uk/244/1/README.txt 244 1 1 text/plain Text en public cc_by_sa_4

README.txt

readme 445 1 2846 document 445 indexcodes.txt text/plain 5a194826a2659d1ff8913f21e7b6675c MD5 692 2015-12-22 16:12:14 https://researchdata.gla.ac.uk/244/2/indexcodes.txt 244 2 2 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/444 http://eprints.org/relation/isVolatileVersionOf https://researchdata.gla.ac.uk/id/document/444 http://eprints.org/relation/isIndexCodesVersionOf https://researchdata.gla.ac.uk/id/document/444 450 2 2865 document 450 Kwanashie_and_Manlove_Dataset_2014.zip application/x-zip 42963ac5447cc278b95fb10ed5f8ae2f MD5 3175719558 2016-01-05 11:52:20 https://researchdata.gla.ac.uk/244/3/Kwanashie_and_Manlove_Dataset_2014.zip 244 3 3 application/x-zip Model en public cc_by_sa_4

Kwanashie_and_Manlove_Dataset_2014.zip

data archive 6975 disk0/00/00/02/44 2015-12-22 14:16:42 2025-06-05 10:53:12 2016-01-05 12:58:59 data_collection show Kwanashie Augustine Manlove David 3976 0000-0001-6754-7308 glaresearchdata:2014-07-10-244 pub 30200000 The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching M is sought which ensures that no blocking pair can exist in which a resident r and hospital h can improve relative to M by becoming assigned to each other. Such a situation is undesirable as it could naturally lead to r and h forming a private arrangement outside of the matching. The original HR model assumes that preference lists are strictly ordered. However in practice, this may be an unreasonable assumption: an agent may find two or more agents equally acceptable, giving rise to ties in its preference list. We thus obtain the Hospitals/Residents problem with Ties (HRT). In such an instance, stable matchings may have different sizes and MAX HRT, the problem of finding a maximum cardinality stable matching, is NP-hard. In this paper we describe an Integer Programming (IP) model for MAX HRT. We also provide some details on the implementation of the model. Finally we present results obtained from an empirical evaluation of the IP model based on real-world and randomly generated problem instances. 2014-07-10 published University of Glasgow 10.5525/gla.researchdata.244 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-07001-8_36 article 2034-07-31 R Check date of last access and update retention schedule accordingly. 2024-07-25 AA: Original Retention date 2024-07-25. Extended to 10 years from last access date. FALSE FALSE http://eprints.gla.ac.uk/id/eprint/97928