Sciweavers

142 search results - page 4 / 29
» A Private Stable Matching Algorithm
Sort
View
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
14 years 3 months ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 6 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
CVPR
2007
IEEE
14 years 10 months ago
Maximally Stable Colour Regions for Recognition and Matching
This paper introduces a novel colour-based affine covariant region detector. Our algorithm is an extension of the maximally stable extremal region (MSER) to colour. The extension ...
Per-Erik Forssén
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 8 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
14 years 1 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...