A matrix-based algorithm to yield efficient allocation in price interval

In order to achieve an efficient allocation in price interval, this paper allows bidders to present their demands list on all items so as to promote the possibility to be allotted an item and generate the farthest price ascending under real demands. We propose a concept named matrix of demand strength which is yield by a multi-price ascending simultaneously, and, based on this matrix, an allocation algorithm is given to guarantee that the revenue of this dynamic auction is maximized. Also, the efficient allocation algorithm based on matrix is implemented by using JAVA program in this paper. Comparing with existed method, result of this paper holds the property that the allocation produced by this paper is optimal.