142 search results - page 1 / 29 » A Private Stable Matching Algorithm |
FC
2006
Springer
14 years 19 days ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
CTRSA
2007
Springer
14 years 27 days ago
2007
Springer
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
ALGORITHMICA
2010
13 years 9 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
DAM
2007
13 years 9 months ago
2007
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
TCS
2008
13 years 9 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...