期刊名称:Discussion Papers in Economics / Department of Economics, University of York
出版年度:2013
卷号:2013
出版社:University of York
摘要:We address the problem of computing a Walrasian equilibrium price in an ascending auction with gross substitutes valuations. In particular, an auction market is considered where there are multiple differentiated goods and each good may have multiple units. Although the ascending auction is known to ï¬nd an equilibrium price vector in ï¬nite time, little is known about its time complexity. The main aim of this paper is to analyze the time complexity of the ascending auction globally and locally, by utilizing the theory of discrete convex analysis. An exact bound on the number of iterations is given in terms of the L infinity distance between the initial price vector and an equilibrium, and an efficient algorithm to update a price vector is designed based on a min-max theorem for submodular function minimization.