Abstract
In this paper we consider the asymmetric assignment problem and we propose a new auction algorithm for its solution. The algorithm uses in a novel way the recently proposed idea of reverse auction, where, in addition to persons bidding for objects by raising their prices, we also have objects competing for persons by essentially offering discounts. In practice, the new algorithm apparently deals better with price wars than the currently existing auction algorithms. As a result, it tends to terminate substantially (and often dramatically) faster than its competitors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.P. Bertsekas, “A distributed algorithm for the assignment problem,” Lab. for Information and Decision Systems Working Paper, M.I.T., Cambridge, MA, March, 1979.
D.P. Bertsekas, “A distributed asynchronous relaxation algorithm for the assignment problem,” Proc. 24th IEEE Conf. Dec. & Contr., pp. 1703–1704, 1985.
D.P. Bertsekas, “The auction algorithm: A distributed relaxation method for the assignment problem,” Ann. Oper. Res. vol. 14, pp. 105–123, 1988.
D.P. Bertsekas, “The auction algorithm for assignment and other network flow problems: A tutorial,” Interfaces, vol. 20, pp. 133–149, 1990.
D.P. Bertsekas, Linear network optimization: Algorithms and codes, M.I.T. Press, Cambridge, MA, 1991.
D.P. Bertsekas, and D.A. Castañon, “Parallel synchronous and asynchronous implementations of the auction algorithm,” Alphatech Report, Burlington, MA, November, 1989 (also Parallel Comput. vol. 17, pp. 707–732, 1991).
D.P. Bertsekas, D.A. Castañon, and H. Tsaknakis, “Reverse auction and the solution of inequality constrained assignment problems,” Alphatech Report, Burlington, MA, March 1991; to appear in SIAM J. on Optimization.
D.P. Bertsekas, and J. Eckstein, “Dual coordinate step methods for linear network flow problems,” Math. Progr., Series B, vol. 42, pp. 203–243, 1988.
D.A. Castañon, “Reverse auction algorithms for assignment problems,” to appear in DIMACS Series in Discrete Math. and Comput. Sci.
D. Kempa, J. Kennington, and H. Zaki, “Performance characteristics of the Jacobi and Gauss-Seidel versions of the auction algorithm on the Alliant FX/8,” Report OR-89–008, Dept. of Mech. and Ind. Engg., Univ. of Illinois, Champaign-Urbana, IL, 1989.
J. Kennington, and R. Helgason, Algorithms for network programming, Wiley, New York, NY, 1980.
C.H. Papadimitriou, and K. Steiglitz, Combinatorial optimization: Algorithms and complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
C. Phillips, and S.A. Zenios, “Experiences with large scale network optimization on the connection machine”, Report 88–11–05, Dept. of Decision Sci., The Wharton School, Univ. of Pennsylvania, Philadelphia, PA, November, 1988.
R.T. Rockafellar, Network flows and monotropic programming, Wiley-Interscience, New York, NY, 1984.
J. Wein, and S.A. Zenios, “Massively parallel auction algorithms for the assignment problem,” Proc. of 3rd Symp. on the Frontiers of Massively Parallel Computation, MD., pp. 90–99, November, 1990.
J. Wein, and S.A. Zenios, “On the massively parallel solution of the assignment problem,” J. of Parallel and Distributed Comput., vol. 13, pp. 228–236, 1991.
H. Zaki, “A comparison of two algorithms for the assignment problem,” Report ORL 90-002, Dept. of Mech. and Ind. Eng., Univ. of Illinois, Urbana, Ill.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bertsekas, D.P., Castañon, D.A. A forward/reverse auction algorithm for asymmetric assignment problems. Comput Optim Applic 1, 277–297 (1992). https://doi.org/10.1007/BF00249638
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00249638