Auction algorithm
The term auction algorithm applies to several variations of a combinatorial optimization algorithm which solves assignment problems. An auction algorithm has been used in a business setting to determine the best prices on a set of products offered to multiple buyers. It is an iterative procedure, so the name auction algorithm is related to a sales auction, where multiple bids are compared to determine the best offer, with the final sales going to the highest bidders.
The auction algorithm is an iterative method to find the optimal prices and an assignment that maximizes the net benefit, and is therefore the maximum weight matching (MWM).[1]
An early auction algorithm was defined by Dimitri P. Bertsekas[1] in 1988, with a later variation as an auction algorithm for shortest paths by Bertsekas in 1991.[2] Is is a simple algorithm for finding shortest paths in a directed graph.[2] In the single origin/single destination case, the auction algorithm maintains a single path starting at the origin, which is then extended or contracted by a single node at each iteration. Simultaneously, at most one dual variable will be adjusted at each iteration, in order to either improve or maintain the value of a dual function. In the case of multiple origins, the auction algorithm is well-suited for parallel computation.[2] The algorithm is closely related to auction algorithms for other network flow problems.[2]
Auction algorithms for shortest hyperpath problems have been defined by De Leone and Pretolani in 1998.[2]
Comparisons
The (sequential) auction algorithms for the shortest path problem have been the subject of experiments which have been reported in technical papers.[3] Experiments clearly show that the auction algorithm is inferior to the state-of-the-art shortest-path algorithms for finding the optimal solution.[3]
Although in the auction algorithm, each iteration never decreases the total benefit (increases or remains the same), with the alternative Hungarian algorithm, each iteration always increases the total.
The auction algorithm of Bertsekas for finding shortest paths within a directed graph is reputed to perform very well on random graphs and on problems with few destinations.[2]
See also
Notes
- ^ a b "A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm", 2006, webpage PDF: MIT-bpmwm-PDF.
- ^ a b c d e f "An Auction Algorithm for Shortest Paths", Dimitri P. Bertsekas, 1991, webpage: PSU-auction-28.
- ^ a b "A note on the pratical performance of the auction algorithm for shortest paths", Jesper Larson, University of Copenhagen, February 1997, webpage: DTU-Views-Auc.
References
- Dimitri P. Bertsekas. "An auction algorithm for shortest paths", SIAM Journal on Optimization, 1:425 -- 447, 1991, webpage: PSU-bertsekas91auction.
- "A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm", 2006, webpage PDF: MIT-bpmwm-PDF.
External links
- Dimitri P. Bertsekas. "An auction algorithm for shortest paths", SIAM Journal on Optimization, 1:425 -- 447, 1991, webpage: PSU-bertsekas91auction.