Self-adjusting binary search trees
Journal of the ACM (JACM)
An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
A data structure for dynamic trees
Journal of Computer and System Sciences
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Erratum: The Stable Allocation (or Ordinal Transportation) Problem
Mathematics of Operations Research
Finite termination of "augmenting path" algorithms in the presence of irrational problem data
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Hi-index | 0.00 |
We introduce and study the generalized stable allocation problem, an "ordinal" variant of the well-studied generalized assignment problem in which we seek a fractional assignment that is stable (in the same sense as in the classical stable marriage problem) with respect to a two-sided set of ranked preference lists. We develop an O (m logn ) algorithm for solving this problem in a bipartite assignment graph with n nodes and m edges. When edge costs are present, we show that it is NP-hard to compute a stable assignment of minimum cost, a result that stands in stark contrast with most other stable matching problems (e.g., the stable marriage and stable allocation problems) for which we can efficiently optimize over the set of all stable assignments.