Advanced Search
MyIDEAS: Login

Multi-Item Vickery-English-Dutch Auctions

Contents:

Author Info

  • Andersson, Tommy

    ()
    (Department of Economics, Lund University)

  • Erlanson, Albin

    ()
    (Department of Economics, Lund University)

Abstract

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English auction (J.K. Sankaran, Math. Soc. Sci. 28:143–150, 1994) and the Vickrey-Dutch auction (D. Mishra and D. Parkes, Games Econ. Behav. 66:326–347, 2009) as special cases. Several properties of this iterative auction are provided. It is, for example, demonstrated that the number of iterations from the starting prices to the VCG prices can be calculated using a measure based on the Chebyshev metric. By means of numerical experiments, it is showed that when the auctioneer knows the bidders’ value distributions, the Vickrey-English-Dutch auction is weakly faster than the Vickrey- English auction and the Vickrey-Dutch auction in 89 percent and 99 percent, respectively, of the investigated problems. A greedy version of the Vickrey-English-Dutch auction is demonstrated to perform even better in the simulation studies. In fact, it follows the theoretically shortest path in 63 percent of the investigated problems.

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/WP12_17.pdf
Download Restriction: no

Bibliographic Info

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

as in new window
Length: 20 pages
Date of creation: 21 Jun 2012
Date of revision: 15 Jan 2013
Publication status: Published as Andersson, Tommy and Albin Erlanson, 'Multi-Item Vickery-English-Dutch Auctions' in Games and Economic Behavior, 2013, pages 116-129.
Handle: RePEc:hhs:lunewp:2012_017

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: Polynomial time algorithms; Multi-item auctions; Unit-demand bidders; Iterations;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

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. Ning Sun & Zaifu Yang, 2009. "Strategy Proof And Privacy Preserving Fair Allocation Mechanism," The Japanese Economic Review, Japanese Economic Association, vol. 60(2), pages 143-151.
  2. Lawrence M. Ausubel & Paul Milgrom, 2002. "Ascending Auctions with Package Bidding," Working Papers 02004, Stanford University, Department of Economics.
  3. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-88, July.
  4. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
  5. Elena Grigorieva & P. Herings & Rudolf Müller & Dries Vermeulen, 2007. "The private value single item bisection auction," Economic Theory, Springer, vol. 30(1), pages 107-118, January.
  6. Sankaran, Jayaram K., 1994. "On a dynamic auction mechanism for a bilateral assignment problem," Mathematical Social Sciences, Elsevier, vol. 28(2), pages 143-150, October.
  7. Andersson, Tommy & Andersson, Christer & Talman, Adolphus Johannes Jan, 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Working Papers 2010:15, Lund University, Department of Economics, revised 28 Jun 2012.
  8. Sven de Vries & James Schummer, 2005. "On Ascending Vickrey Auctions for Heterogeneous Objects," 2005 Meeting Papers 389, Society for Economic Dynamics.
  9. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
  10. 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.
  11. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Society for Computational Economics, vol. 39(2), pages 113-133, February.
  12. MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," CORE Discussion Papers 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  13. Debasis Mishra & David C. Parkes, 2007. "Multi-item Vickrey-Dutch auctions," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 07-04, Indian Statistical Institute, New Delhi, India.
  14. Cramton, Peter, 1998. "Ascending auctions," European Economic Review, Elsevier, vol. 42(3-5), pages 745-756, May.
  15. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
  16. Engelbrecht-Wiggans, R. & Kahn, C.M., 1990. "Protecting the Wnner: Second-price Versus Oral Auctions," University of Chicago - Economics Research Center 90-8, Chicago - Economics Research Center.
  17. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
  18. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
  19. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2005. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Levine's Bibliography 784828000000000133, UCLA Department of Economics.
  20. Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
  21. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
  22. Motty Perry & Philip J. Reny, 2005. "An Efficient Multi-Unit Ascending Auction," Review of Economic Studies, Oxford University Press, vol. 72(2), pages 567-592.
  23. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-79, June.
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, T. & Gudmundsson, J. & Talman, A.J.J. & Yang, Z., 2013. "A Competitive Partnership Formation Process," Discussion Paper 2013-008, Tilburg University, Center for Economic Research.

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:2012_017. 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.