Rotation-based formulation for stable matching

Show simple item record

dc.contributor.author Siala, Mohamed
dc.contributor.author O'Sullivan, Barry
dc.contributor.editor Beck, J. Christopher
dc.date.accessioned 2018-01-15T12:57:24Z
dc.date.available 2018-01-15T12:57:24Z
dc.date.issued 2017-08-23
dc.identifier.citation Siala, 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.volume 10416 en
dc.identifier.startpage 262 en
dc.identifier.endpage 277 en
dc.identifier.isbn 978-3-319-66158-2
dc.identifier.uri http://hdl.handle.net/10468/5278
dc.identifier.doi 10.1007/978-3-319-66158-2_17
dc.description.abstract We 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.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Springer International Publishing en
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_17 en
dc.subject CP models en
dc.subject Stable marriage (SM) problem en
dc.subject Constraint programming en
dc.subject Balanced stable matching en
dc.subject Constraint theory en
dc.subject Arc consistency en
dc.subject Constraint programming en
dc.subject Filtering rules en
dc.subject Hard instances en
dc.subject Quadratic time en
dc.subject Stable matching en
dc.subject Stable matching problem en
dc.subject State of the art en
dc.subject Computer programming en
dc.title Rotation-based formulation for stable matching en
dc.type Book chapter en
dc.type Conference item en
dc.internal.authorcontactother Mohamed Siala, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: mohamed.siala@insight-centre.org en
dc.internal.availability Full text available en
dc.check.info Access to this article is restricted until 12 months after publication by request of the publisher. en
dc.check.date 2018-08-23
dc.date.updated 2018-01-12T12:43:09Z
dc.description.version Accepted Version en
dc.internal.rssid 421497215
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Lecture Notes in Computer Science en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Melbourne, VIC, Australia en
dc.internal.placepublication Cham en
dc.internal.IRISemailaddress mohamed.siala@insight-centre.org en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/


Files in this item

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement