Sciweavers

142 search results - page 3 / 29
» A Private Stable Matching Algorithm
Sort
View
ICALP
1991
Springer
14 years 6 days ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
14 years 11 days ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang
SODA
1994
ACM
71views Algorithms» more  SODA 1994»
13 years 10 months ago
A Sublinear Parallel Algorithm for Stable Matching
Tomás Feder, Nimrod Megiddo, Serge A. Plotk...
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
14 years 1 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove
CCR
2006
122views more  CCR 2006»
13 years 8 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer