Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Economics, University of York in its series Discussion Papers with number 13/13.
Date of creation: Jun 2013
Date of revision:
Contact details of provider:
Postal: Department of Economics and Related Studies, University of York, York, YO10 5DD, United Kingdom
Phone: (0)1904 323776
Fax: (0)1904 323759
Web page: http://www.york.ac.uk/economics/
More information through EDIRC
Dynamic auction; gross substitutes; equilibrium; complexity;
Find related papers by JEL classification:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-07-05 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Paul Hodgson).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.