Specialised Binary Constraint for the Stable Marriage Problem with Ties and incomplete preference lists By Chris Unsworth and Patrick Prosser.

Slides:



Advertisements
Similar presentations
1 Stable Matching A Special Case of Stable Marriage.
Advertisements

n-ary Relations and Their Applications
Modelling and Solving the Stable Marriage problem using Constraint Programming David Manlove and Gregg OMalley University Of Glasgow Department of Computing.
Stable Matching Problems with Constant Length Preference Lists Rob Irving, David Manlove, Gregg OMalley University Of Glasgow Department of Computing Science.
An empirical study of the stable marriage problem with ties and incomplete lists (SMTI) Ian Gent & Patrick Prosser.
Blah blah blah. Zoes shark Thanks to the conference artist Phoebe.
Maximal Independent Sets of a Hypergraph IJCAI01.
The Stable Marriage Problem and Constraint Programming.
LAW February A 5/3 approximation algorithm for a hard case of stable marriage Rob Irving Computing Science Department University of Glasgow (joint.
Piyush Kumar (Lecture 3: Stable Marriage) Welcome to COT5405.
A Constraint Programming Approach to the Hospitals / Residents Problem By David Manlove, Gregg O’Malley, Patrick Prosser and Chris Unsworth.
El Problema del Matrimonio Estable El Problema del Matrimonio Estable Roger Z. Ríos Programa de Posgrado en Ing. de Sistemas Facultad de Ing. Mecánica.
Order encoding x i ↔ (X ≥ i)(X = 3) = [1,1,1,0,0] Problem (hard) Problem (hard) Solution CNF Encoding Finite Domain Problem Solving Model Constraint Model.
Matching Theory.
Lecture #9 EGR 277 – Digital Logic
Matching problems Toby Walsh NICTA and UNSW. Motivation Agents may express preferences for issues other than a collective decision  Preferences for a.
But Shaun’s already proved P equals NP. Can’t we move onto quantified SAT? Woof!
Specialised N-ary Constraint for the Stable Marriage Problem By Chris Unsworth and Patrick Prosser.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
What’s the problem? Something like stable marriage problem … but without sex.
Joint work with Rob Irving
A. Levitin “Introduction to the Design & Analysis of Algorithms,” 3rd ed., Ch. 10 ©2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved.
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Example – calculating interest until the amount doubles using a for loop: will calculate up to 1000 years, if necessary if condition decides when to terminate.
Stabile Marriage Thanks to Mohammad Mahdian Lab for Computer Science, MIT.
On Efficient Spatial Matching Raymond Chi-Wing Wong (the Chinese University of Hong Kong) Yufei Tao (the Chinese University of Hong Kong) Ada Wai-Chee.
Chapter 26 of CLSR Bipartite Matching By Dr. M. Sakalli, Sources: Levitin and many other CSE, Marmara Univ. May/2009.
Lecture 4 CSE 331 Sep 9, Blog posts for lectures Starts from today See Sep 8 post on the blog.
130 September 2003 Tractability by Approximating Constraint Languages Martin Green and David Cohen CP 2003 Ninth International Conference on Principles.
Data Flow Analysis Compiler Design Nov. 8, 2005.
Global Constraints for Lexicographic Orderings Alan Frisch, Ian Miguel (University of York) Brahim Hnich, Toby Walsh (4C) Zeynep Kiziltan (Uppsala University)
Week 7 - Programming II Today – more features: – Loop control – Extending if/else – Nesting of loops Debugging tools Textbook chapter 7, pages
Strong Stability in the Hospitals/Residents Problem Robert W. Irving, David F. Manlove and Sandy Scott University of Glasgow Department of Computing Science.
Lecture 6 CSE 331 Sep 10, Homeworks HW 1 posted online: see blog/piazza Pickup graded HW 0 in TA OHs.
The Stable Marriage Problem
Local Computation Mechanism Design Shai Vardi, Tel Aviv University Joint work with Avinatan Hassidim & Yishay Mansour Men’s preferences first second Women’s.
L3 #1 The Hospitals / Residents Problem and Some Extensions David Manlove University of Glasgow Department of Computing Science Supported by EPSRC grant.
Pelvic floor Specialised Constraints for Stable Matching Problems Contact details: 17 Lilybank Gardens Glasgow G12 8QQ The Problem.
Lecture 4 CSE 331 Sep 6, TA change Swapnoneel will leave us for 531 Jiun-Jie Wang will join us.
Lecture 5 CSE 331 Sep 11, Submit the form I’ll need confirmation in writing. No graded material will be handed back till I get this signed form.
Chapter 10 IterativeImprovement. Iterative Improvement Algorithm design technique for solving optimization problems b Start with a feasible solution b.
1 The Stable Marriage Problem Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
BY: Taylor and Dustin POLYNOMIALS ARE AWESOME!!!
A Constraint Programming Approach to the Hospitals / Residents Problem By David Manlove, Gregg O’Malley, Patrick Prosser and Chris Unsworth.
BPS - 5th Ed. Chapter 251 Nonparametric Tests. BPS - 5th Ed. Chapter 252 Inference Methods So Far u Variables have had Normal distributions. u In practice,
The Stable Marriage Problem
Game Engineering Robert Aumann Center for the Study of Rationality The Hebrew University of Jerusalem.
Fair Shares.
Chapter 10 IterativeImprovement Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Stable Matching.
Stable Marriage Problem
Lecture 4 CSE 331 Sep 7, 2016.
Introduction to the Design and Analysis of Algorithms
Chapter 10 Iterative Improvement
The Stable Marriage Problem
Week 8 - Programming II Today – more features: Loop control
Lecture 5 CSE 331 Sep 10, 2010.
Lecture 4 CSE 331 Sep 6, 2017.
Lecture 6 CSE 331 Sep 11, 2017.
Lecture 5 CSE 331 Sep 6, 2013.
Lecture 5 CSE 331 Sep 7, 2012.
Blah blah blah.
Bipartite Matching By Dr. M
Lecture 5 CSE 331 Sep 5, 2014.
Lecture 6 CSE 331 Sep 12, 2016.
Lecture 7 CSE 331 Sep 10, 2014.
Piyush Kumar (Lecture 3: Stable Marriage)
A Grand Tour of Stable Matching Problems
Lecture 7 CSE 331 Sep 11, 2013.
15th Scandinavian Workshop on Algorithm Theory
Presentation transcript:

Specialised Binary Constraint for the Stable Marriage Problem with Ties and incomplete preference lists By Chris Unsworth and Patrick Prosser

Contents The Problem Representing Ties Specialised Binary Constraint Computational Comparison Conclusion Questions

The Stable Marriage Problem Men Women Bob Ian Jon : Ian Jon Bob : Jon Ian Bob : Bob Jon Ian : Sue Jan Liz : Liz Jan Sue : Jan Sue Liz Jan Liz Sue We have n menand n women Each man ranks the n women And each woman ranks the n men Objective : To find a matching of men to women Such that the matching is Stable

The Stable Marriage Problem Men Women Bob Ian Jon : Ian Jon Bob : Jon Ian Bob : Bob Jon Ian : Sue Jan Liz : Liz Jan Sue : Jan Sue Liz Jan Liz Sue A Matching But not a stable one  Bob and Sue would rather be matched to each other than to there assigned partners In this matching Bob and Sue are a Blocking pair A matching is only stable iff it contains no Blocking pairs

Ties and incomplete Preference lists Men Women Alf Bob Tom Ian Jim : Tom Alf Bob Ian : Ian (Alf Bob Jim) : (Alf Ian) Tom Bob : Tom (Jim Ian Bob) Alf : Ian Jim (Tom Bob) : Zoe (Ann Liz) Joe : Liz Jes (Ann Zoe) : (Ann Jes Liz Zoe) : Ann Jes Liz Zoe Joe : Joe Zoe Jes Ann Joe Liz Zoe Jes Ties indicate indifference (shown in brackets) Incomplete list indicate some potential partners are unacceptable

Representing Ties Each entry represented as a Triple Absolute potion in the list (ties broken arbitrarily) Absolute potion of the first person in the tie Absolute potion of the last person in the tie Zoe : Tom (Jim Ian Bob) Alf {1,1,1} {2,2,4} {2,3,4} {2,4,4} {5,5,5}

Problem properties Different levels of stability Here we use weak stability (details in the paper) All instances have contain a weakly stable matching can be found in polynomial time Different size matching To find the largest is NP-Hard

Previous Constraint Encoding 2n Integer variables (z 1..z n, z n+1..z 2n ) Initial domains of 1.. L (L = length of preference list) Domain values represent preferences i.e. Z i = 3 : person i matched to 3 rd choice O(n 2 ) constraints one for each z i,z j pair where 1 ≤ i ≤ n < j ≤ 2n Explicit list of allowed tuples Each O(n 2 ) in size Propagates in O(n 4 ) time Takes O(n 4 ) space

New constraint Encoding Same 2n variables O(n 2 ) specialised constraints one for each z i,z j pair where 1 ≤ i ≤ n < j ≤ 2n Two methods init() Called when initialised (details in paper) remVal(z,a) Called when a is removed from z (details in paper) Propagates in O(n 3 ) time Takes O(n 2 ) space

Conclusion & Future work New specialised binary constraint for SMTI Significant performance increase over previous constraint solutions n-ary constraint Empirical comparison

Questions? Thank you