Advanced Search
MyIDEAS: Login to save this paper or follow this series

Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders

Contents:

Author Info

  • Andersson, Tommy

    ()
    (Department of Economics, Lund University)

  • Andersson, Christer

    (Department of Economics, Lund University)

  • Talman, Adolphus Johannes Jan

    ()
    (CentER, Department of Econometrics and Operations Research, Tilburg University)

Abstract

This paper analyzes the problem of selecting a set of items whose prices are to be updated in the next iteration in so called simple ascending auctions with unit-demand bidders. A family of sets called "sets in excess demand" is introduced, and the main results demonstrate that a simple ascending auction always terminates at the minimum Walrasian equilibrium prices if and only if the selection belongs to this family. The paper also specifies a number of properties of the family of sets in excess demand and relate previously proposed selections to it.

Download Info

If 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.
File URL: http://project.nek.lu.se/publications/workpap/papers/WP10_15.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Lund University, Department of Economics in its series Working Papers with number 2010:15.

as in new window
Length: 15 pages
Date of creation: 17 Dec 2010
Date of revision: 28 Jun 2012
Publication status: Forthcoming as Andersson, Tommy, Christer Andersson and Adolphus Johannes Jan Talman, 'Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders' in Annals of Operations Research, 2013.
Handle: RePEc:hhs:lunewp:2010_015

Contact details of provider:
Postal: Department of Economics, School of Economics and Management, Lund University, Box 7082, S-220 07 Lund,Sweden
Phone: +46 +46 222 0000
Fax: +46 +46 2224613
Web page: http://www.nek.lu.se/en
More information through EDIRC

Related research

Keywords: Multi-item auctions; unit-demand; excess demand; algorithms;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-88, July.
  2. Sven de Vries & James Schummer, 2005. "On Ascending Vickrey Auctions for Heterogeneous Objects," 2005 Meeting Papers 389, Society for Economic Dynamics.
  3. Alkan, Ahmet & Demange, Gabrielle & Gale, David, 1991. "Fair Allocation of Indivisible Goods and Criteria of Justice," Econometrica, Econometric Society, vol. 59(4), pages 1023-39, July.
  4. Atila Abdulkadiroglu & Tayfun Sonmez & M. Utku Unver, 2002. "Room assignment-rent division: A market approach," Discussion Papers 0102-11, Columbia University, Department of Economics.
  5. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Society for Computational Economics, vol. 39(2), pages 113-133, February.
  6. Andersson, Tommy & Svensson, Lars-Gunnar, 2008. "Non-manipulable assignment of individuals to positions revisited," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 350-354, November.
  7. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Andersson , Tommy & Gudmundsson , Jens & Talman , Adolphus & Yang , Zaifu, 2013. "A Competitive Partnership Formation Process," Working Papers 2013:2, Lund University, Department of Economics.
  2. Andersson , Tommy & Yang , Zaifu & Zhang , Dongmo, 2014. "How to Efficiently Allocate Houses under Price Controls?," Working Papers 2014:24, Lund University, Department of Economics.
  3. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
  4. Serizawa, Shigehiro & Morimoto, Shuhei, 0. "Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule," Theoretical Economics, Econometric Society.
  5. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Society for Computational Economics, vol. 39(2), pages 113-133, February.
  6. Andersson , Tommy & Erlanson , Albin & Gudmundsson , Jens & Habis , Helga & Ingebretsen Carlson, Jim & Kratz, Jörgen, 2014. "A Method for Finding the Maximal Set in Excess Demand," Working Papers 2014:9, Lund University, Department of Economics.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:hhs:lunewp:2010_015. See general 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: (David Edgerton).

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.