Answers are grounded in this paper and cite their sources.
The auction algorithm is an intuitive method for solving the classical assignment problem. It outperforms substantially its main competitors for important types of problems, both in theory and in practice and is also naturally well suited for parallel computation. I derive the algorithm from first principles, explain its computational properties, and discuss its extensions to transportation and transshipment problems.
No takes yet. Share an insight, caveat, or question.
Dimitri P. Bertsekas (1990) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: