On-line algorithms for weighted bipartite matching and stable marriages

Abstract

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. This algorithm is optimal - there is no on-line deterministic algorithm that achieves a competitive ratio better than (2n — 1) in all metric spaces. We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple “first come, first served” deterministic algorithm yields on the average O(n log n) unstable pairs, but in the worst case no deterministic or randomized on-line algorithm can do better than Ω(n2) unstable pairs. This appears to be the first on-line problem for which provably one cannot do better with randomization; for most on-line problems studied in the past, randomization has helped in improving the performance.