Rotation-based formulation for stable matching

Simple item page
dc.contributor.authorSiala, Mohamed
dc.contributor.authorO'Sullivan, Barry
dc.contributor.editorBeck, J. Christopher
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2018-01-15T12:57:24Z
dc.date.available2018-01-15T12:57:24Z
dc.date.issued2017-08-23
dc.date.updated2018-01-12T12:43:09Z
dc.description.abstractWe introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time. Our experimental study on hard instances of sex-equal and balanced stable matching shows the efficiency of one of our propositions as compared with the state-of-the-art constraint programming approach.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationSiala, M. and O’Sullivan, B. (2017) 'Rotation-Based Formulation for Stable Matching', in Beck, J.C. (ed.) Principles and Practice of Constraint Programming: 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 – September 1, 2017, Lecture Notes in Computer Science, LCNS vol. 10416, Cham: Springer International Publishing, pp. 262-277.en
dc.identifier.doi10.1007/978-3-319-66158-2_17
dc.identifier.endpage277en
dc.identifier.isbn978-3-319-66158-2
dc.identifier.journaltitleLecture Notes in Computer Scienceen
dc.identifier.startpage262en
dc.identifier.urihttps://hdl.handle.net/10468/5278
dc.identifier.volume10416en
dc.language.isoenen
dc.publisherSpringer International Publishingen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/
dc.rights© Springer International Publishing AG 2017. The final publication is available at Springer via http://dx.doi.org/ 10.1007/978-3-319-66158-2_17en
dc.subjectCP modelsen
dc.subjectStable marriage (SM) problemen
dc.subjectConstraint programmingen
dc.subjectBalanced stable matchingen
dc.subjectConstraint theoryen
dc.subjectArc consistencyen
dc.subjectConstraint programmingen
dc.subjectFiltering rulesen
dc.subjectHard instancesen
dc.subjectQuadratic timeen
dc.subjectStable matchingen
dc.subjectStable matching problemen
dc.subjectState of the arten
dc.subjectComputer programmingen
dc.titleRotation-based formulation for stable matchingen
dc.typeBook chapteren
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
4582.pdf
Size:
413.73 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items