Auction algorithm for shortest path problems was firstly proposed by Prof Bertsekas in 1991. In the paper, a new variant in acyclic networks is proposed, in which a new extension method is adopted, and the complexity is then reduced to O(m), where m is the number of edges.