Brian C. Dean Associate Professor Division of Computer Science School of Computing, Clemson University Office: McAdams Hall, Room 205 Phone: 864-656-5866 Mail: Brian C. Dean, School of Computing, Box 340974, Clemson SC 29634-0974 Email: bcdean@cs.clemson.edu

Faster Algorithms for Stable Allocation Problems

We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Baiou and Balinski in 2002. By leveraging new structural properties and sophisticated data structures, we show how to solve this problem in O(m log n) time on a bipartite instance with n vertices and m edges, improving the best known running time of O(mn). Building on this algorithm, we provide an algorithm for the non-bipartite stable allocation problem running in O(m log n) time with high probability. Finally, we give a polynomial-time algorithm for solving the "optimal" variant of the bipartite stable allocation problem, as well as a 2-approximation algorithm for the NP-hard "optimal" variant of the non-bipartite stable allocation problem.

Available in pdf.