The auction algorithm: A distributed relaxation method for the assignment problem

We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm operates like an auction whereby unassigned persons bid simultaneously for objects thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. The algorithm can also be interpreted as a Jacobi — like relaxation method for solving a dual problem. Its (sequential) worst — case complexity, for a particular implementation that uses scaling, is O(NAlog(NC)), where N is the number of persons, A is the number of pairs of persons and objects that can be assigned to each other, and C is the maximum absolute object value. Computational results show that, for large problems, the algorithm is competitive with existing methods even without the benefit of parallelism. When executed on a parallel machine, the algorithm exhibits substantial speedup.

[1]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[2]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[3]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[4]  Darwin Klingman,et al.  The alternating basis algorithm for assignment problems , 1977, Math. Program..

[5]  Gérard M. Baudet,et al.  Asynchronous Iterative Methods for Multiprocessors , 1978, JACM.

[6]  Richard V. Helgason,et al.  Algorithms for network programming , 1980 .

[7]  Ming S. Hung,et al.  Solving the Assignment Problem by Relaxation , 1980, Oper. Res..

[8]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[9]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[10]  V. Crawford,et al.  Job Matching with Heterogeneous Firms and Workers , 1981 .

[11]  Alvin E. Roth,et al.  The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..

[12]  M. Engquist A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[13]  Leon F. McGinnis,et al.  Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..

[14]  Ming S. Hung,et al.  Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[15]  Dimitri P. Bertsekas,et al.  Distributed asynchronous computation of fixed points , 1983, Math. Program..

[16]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[17]  Michel Balinski,et al.  Signature Methods for the Assignment Problem , 1985, Oper. Res..

[18]  J. Orlin Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[19]  Dimitri P. Bertsekas,et al.  A unified framework for primal-dual methods in minimum cost network flow problems , 1985, Math. Program..

[20]  D. Bertsekas A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[21]  Michel Balinski,et al.  A competitive (dual) simplex method for the assignment problem , 1986, Math. Program..

[22]  Donald Goldfarb,et al.  Efficient dual simplex algorithms for the assignment problem , 1986, Math. Program..

[23]  D. Bertsekas Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[24]  S. Zenios,et al.  Relaxation techniques for strictly convex network problems , 1986 .

[25]  Darwin Klingman,et al.  Threshold assignment algorithm , 1986 .

[26]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[27]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[28]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[29]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[30]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[31]  Stavros A. Zenios,et al.  Nonlinear network optimization on a massively parallel connection machine , 1988 .

[32]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[33]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .