1 / 5

Chris Unsworth

Chris Unsworth. A Specialised Constraint approach for Stable Matching problems. The Stable marriage problem. There exists an optimal algorithm EGS runs in O(n 2 ) time There are optimal constraint encodings Boolean encoding proposed CP’01 Limitations EGS is highly specialised

harken
Download Presentation

Chris Unsworth

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chris Unsworth A Specialised Constraint approach for Stable Matching problems

  2. The Stable marriage problem • There exists an optimal algorithm • EGS runs in O(n2) time • There are optimal constraint encodings • Boolean encoding proposed CP’01 • Limitations • EGS is highly specialised • CP encodings are slow • Require large supporting data structures • My contribution • Fast specialised constraints for SM • SM2, SMN, BSMN, CSMN • Theoretically and empirically tested • Proven to be sound and complete • Demonstrated their versatility

  3. The Hospital/Residents problem • Two linear time algorithms exist • The Resident-oriented and Hospital-oriented algorithms • Constraint models have been proposed • Constraint based encoding proposed at CPAIOR’07 • My contribution • Fast specialised constraint for HR • HRN • Theoretically and empirically tested • Demonstrated its versatility

  4. Large scale empirical study • Compared all stable marriage constraint models • Over 20,000 randomly generated instances • Demonstrated Versatility • Eight variants of stable matching problems taken from the literature • Optimisation problems • Sex-equal, balanced, egalitarian • Specialisations • Man-exchange, forced pairs, couples

  5. Future directions • Optimisation problems • Variable and value ordering heuristics • Different search strategies • Ties and incomplete preference lists • How current constraint models can be adapted • How the problem can be reformulated • Higher levels of consistency • Enforcing GAC over SMN • Emulating stable pairs algorithm

More Related