期刊名称：Discussion Papers in Economics / Department of Economics, University of York
出版年度：2014
卷号：2014
出版社：University of York
摘要：We examine an auction model where there are many different goods, each good has multiple units, and bidders have gross substitutes valuations over the goods. We analyze the number of iterations in iterative auction algorithms for the model based on the theory of discrete convex analysis. By making use of Lâ™®-convexity of the Lyapunov function we derive exact bounds on the number of iterations in terms of the ℓ∞-distance between the initial price vector and the found equilibrium. Our results extend and unify the price adjustment algorithms of Ausubel (2006) and other existing algorithmsfor the unit-demand auction models, offering computational complexity results for these algorithms, and reinforcing the connection between auction theory and discrete convex analysis.
Loading...
