An Implementation of the Dynamic Auction Algorithm under Price Rigidities

In paper [1], Yang proposed a dynamic auction algorithm under price rigidities for item allocation. The problem under consideration is a very difficult one in the sense that it is NP-Complete. The algorithm is based on a specific allocation rule and a rationing system of Rⁿ. In this paper, we discuss a practical implementation of the algorithm and present a computer program using binary operations and bipartite matching. A number of test examples with different n(the number of item) and m(the number of bidder) and price rigidities are presented. Numerical results indicate that the algorithm is computationally simple and stable.