The Auction Algorithm : a Distributed Relaxation Method for the Assignment

@inproceedings{BertsekasTheAA,
  title={The Auction Algorithm : a Distributed Relaxation Method for the Assignment},
  author={Dimitri P. Bertsekas}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 32 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 400 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 261 extracted citations

400 Citations

02040'88'94'01'08'15
Citations per Year
Semantic Scholar estimates that this publication has 400 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…