An approach to robustness in stable marriage and stable roommates problems

Simple item page
dc.check.embargoformatEmbargo not applicable (If you have not submitted an e-thesis or do not want to request an embargo)en
dc.check.infoNot applicableen
dc.check.opt-outNot applicableen
dc.check.reasonNot applicableen
dc.check.typeNo Embargo Required
dc.contributor.advisorO'Sullivan, Barryen
dc.contributor.advisorSiala, Mohameden
dc.contributor.authorGenc, Begum
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2019-08-21T08:58:56Z
dc.date.available2019-08-21T08:58:56Z
dc.date.issued2019
dc.date.submitted2019
dc.description.abstractThis dissertation focuses on a novel concept of robustness within the context of matching problems. Our robustness notion for the stable matching framework is motivated by the unforeseen events that may occur after a matching is computed. We define the notion of (a,b)-supermatches as a measure of robustness of a matching. An (a,b)-supermatch characterizes a stable matching such that if any combination of 'a' pairs want to leave the matching, there exists an alternative matching in which those 'a' pairs are assigned new partners, and in order to obtain the new assignment at most 'b' other pairs are broken. We first formally define the notion of (a,b)-supermatches by using one of the most famous matching problems, namely the Stable Marriage problem (SM), as the platform. We name the problem of finding an (a,b)-supermatch to the SM as the Robust Stable Marriage problem (RSM). Subsequently, we prove that RSM is NP-hard, and the decision problem for the case where a=1 (i.e. deciding if there exists a (1,b)-supermatch) is NP-complete. We also develop a constraint programming model and a number of meta-heuristic approaches to find a (1,b)-supermatch that minimizes the value of 'b' for the RSM. Following the results on the RSM, we extend the notion of (a,b)-supermatches to the Stable Roommates problem (SR), namely, the Robust Stable Roommates problem (RSR). We show that the NP-hardness is also valid for the RSR, and we also define a polynomial-time procedure for the RSR to decide if a given stable matching is a (1,b)-supermatch. Similarly, we provide a number of meta-heuristic models to solve the optimization problem for finding a (1,b)-supermatch that minimizes the value of 'b'. We conclude this dissertation by providing some empirical results on the robustness of different datasets of RSM and RSR instances.en
dc.description.statusNot peer revieweden
dc.description.versionAccepted Version
dc.format.mimetypeapplication/pdfen
dc.identifier.citationGenc, B. 2019. An approach to robustness in stable marriage and stable roommates problems. PhD Thesis, University College Cork.en
dc.identifier.endpage207en
dc.identifier.urihttps://hdl.handle.net/10468/8361
dc.language.isoenen
dc.publisherUniversity College Corken
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.rights© 2019, Begum Genc.en
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectRobustnessen
dc.subject(a,b)-supermatchen
dc.subjectOptimizationen
dc.subjectStable marriageen
dc.subjectStable roommatesen
dc.thesis.opt-outfalse
dc.titleAn approach to robustness in stable marriage and stable roommates problemsen
dc.typeDoctoral thesisen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhDen
ucc.workflow.supervisorosullivan.barry@ucc.ie
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
abstract.txt
Size:
1.79 KB
Format:
Plain Text
Description:
Abstract
Thumbnail Image
Name:
thesis.pdf
Size:
2.46 MB
Format:
Adobe Portable Document Format
Description:
Full Text E-thesis
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
5.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Doctoral Theses
College of Science, Engineering and Food Science - Doctoral Theses
Computer Science - Doctoral Theses
Insight Centre for Data Analytics - Doctoral Theses