Ian Philip Gent, Patrick Prosser  Home/Search
Context Related
| dcs.stand.ac.uk/~...apes402002.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.stand.ac.uk/~a...apesreports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the first complete algorithm for the SMTI problem, the stable marriage problem with ties and incomplete lists. We do this in the form of a constraint programming encoding of the problem. With this we are able to carry out the first empirical study of the complete solution of SMTI instances. In the stable marriage problem (SM) [5] we have n men and n women. Each man ranks the n women, giving himself a preference list. Similarly each woman ranks the men, giving herself a preference... (Update)
Context of citations to this paper: More
.... to SAT 2002 Committee: This paper is linked to a paper submitted to ECAI 2002, on solving the SMTI problem using constraint programming [3]. Our current plan for a long paper to the special issue of AMAI is to combine these two papers and thereby compare the techniques. 1 The...
Cited by: More
Private and Efficient Stable Marriages (Matching) - Atkinson, Bartak, Silaghi.. (2006) (Correct)
SAT Encodings of the Stable Marriage Problem with Ties and.. - Gent, Prosser (2002) (Correct)
Similar documents (at the sentence level):
5.5%: An Empirical Study of the Stable Marriage Problem with - Ties And Incomplete (2002) (Correct)
Active bibliography (related documents): More All
0.6: Inapproximability of Stable Marriage Problems - Halldórsson, Iwama, Miyazaki.. (2001) (Correct)
0.3: Many-to-one Stable Matching: Geometry and Fairness - Sethuraman, Teo, Qian (2004) (Correct)
0.2: Hunter-Gatherer Tutorial - Beale, Mahesh, Nirenburg (Correct)
Similar documents based on text: More All
0.3: Stable Marriage with Incomplete Lists and Ties (Extended Abstract) - Iwama, al. (Correct)
0.3: Stable Marriage with Incomplete Lists and Ties - Iwama, Manlove, Miyazaki, Morita (1999) (Correct)
0.3: The Stable Marriage Problem With Restricted Pairs - Ania Dias Guilherme (Correct)
Related documents from co-citation: More All
2: Secure distributed constraint satisfaction: Reaching agreement without revealing.. (context) - Yokoo, Suzuki et al. - 2002
2: Desk-mates (stable matching) with privacy of preferences, and a new distributed .. (context) - Silaghi, Abhyankar et al. - 2005
BibTeX entry: (Update)
I.P. Gent and P. Prosser. An empirical study of the stable marriage problem with ties and incomplete lists. Technical Report APES-40-2002, APES Research Group, January 2002. Available from http://www.dcs.stand. ac.uk/~apes/apesreports.html. http://citeseer.ist.psu.edu/gent02empirical.html More
@misc{ gent02empirical,
author = "I. Gent and P. Prosser",
title = "An empirical study of the stable marriage problem with ties and incomplete
lists",
text = "I.P. Gent and P. Prosser. An empirical study of the stable marriage problem
with ties and incomplete lists. Technical Report APES-40-2002, APES Research
Group, January 2002. Available from http://www.dcs.stand. ac.uk/~apes/apesreports.html.",
year = "2002",
url = "citeseer.ist.psu.edu/gent02empirical.html" }
Citations (may not include all citations):473 Foundations of Constraint Satisfaction (context) - Tsang - 1993
329 Where the really hard problems are - Cheeseman, Kanefsky et al. - 1991
59 The constrainedness of search - Gent, MacIntyre et al. - 1996
54 College admissions and the stability of marriage (context) - Gale, Shapley - 1962
52 A filtering algorithm for constraints of difference in csps (context) - Regin - 1994
34 The Stable Marriage Problem: Structure and Algorithms (context) - Gusfield, Irving - 1989
6 Hard variants of stable marriage (context) - Manlove, Irving et al. - 1999
6 Hard variants of stable marriage (context) - Manlove, Irving et al. - 2002
5 The complexity of some polynomial consistency algorithms for.. (context) - Mackworth, Freuder - 1985
4 Stable marriage with incomplete lists and ties - Iwama, Manlove et al. - 1999
3 A constraint programming approach to the stable marriage pro.. (context) - Gent, Irving et al. - 2001
http://www.chococonstraints
Documents on the same site (http://www.dcs.st-and.ac.uk/~apes/apesreports.html): More
Further Analysis of SBDS against SBDD - Petrie (2003) (Correct)
A Case Study of Constraint Programming for Configuration.. - McDonald, Prosser (2002) (Correct)
The Tractability of Global Constraints - Bessiere, Hebrard, Hnich, Walsh (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC