Skip to main content

Mechanism for Optimally Trading Off Revenue and Efficiency in Multi-unit Auctions

  • Conference paper
  • 274 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3048))

Abstract

We study auctioning multiple units of the same good to potential buyers with single unit demand (i.e. every buyer wants only one unit of the good). Depending on the objective of the seller, different selling mechanisms are desirable. The Vickrey auction with a truthful reserve price is optimal when the objective is efficiency – allocating the units to the parties who values them the most. The Myerson auction is optimal when the objective is the seller’s expected utility. These two objectives are generally in conflict, and cannot be maximized with one mechanism. In many real-world settings—such as privatization and competing electronic marketplaces—it is not clear that the objective should be either efficiency or seller’s expected utility. Typically, one of these objectives should weigh more than the other, but both are important. We account for both objectives by designing a new deterministic dominant strategy auction mechanism that maximizes expected social welfare subject to a minimum constraint on the seller’s expected utility. This way the seller can maximize social welfare subject to doing well enough for himself.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baliga, S., Vohra, R.: Market Research and Market Design. Advances in Theoretical Economics 3(1) (2003)

    Google Scholar 

  2. Conitzer, V., Sandholm, V.: Complexity of Mechanism Design. In: UAI 2002 (2002)

    Google Scholar 

  3. Fiat, A., Goldberg, A., Hartline, J., Karlin, A.: Competitive Generalized Auctions. In: STOC 2002 (2002)

    Google Scholar 

  4. Gelman, A.B., Carlin, J.S., Stern, H.S., Rubin, D.B.: Bayesian data analysis. Chapman and Hall/CRC (1995)

    Google Scholar 

  5. Krishna, V.: Auction theory. Academic Press, London (2002)

    Google Scholar 

  6. Krishna, V., Perry, M.: Efficient mechanism design, Working Paper (1998)

    Google Scholar 

  7. Maskin, E.S., Riley, J.G.: Optimal multi-unit auctions. The Economics of Missing Markets, Information, and Games. Oxford University Press/Clarendon Press (1989)

    Google Scholar 

  8. Monderer, D., Tennenholtz, M.: Asymptotically Optimal Multi-Object Auctions for Risk- Averse Agents (2000) (manuscript)

    Google Scholar 

  9. Myerson, R.: Optimal auction design. Mathematics of operational research 6, 58–73 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Rockafellar, R.V.: Convex Analysis. Princeton University Press, Princeton (1996)

    Google Scholar 

  11. Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance 16, 8–37 (1961)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Likhodedov, A., Sandholm, T. (2004). Mechanism for Optimally Trading Off Revenue and Efficiency in Multi-unit Auctions. In: Faratin, P., Parkes, D.C., Rodríguez-Aguilar, J.A., Walsh, W.E. (eds) Agent-Mediated Electronic Commerce V. Designing Mechanisms and Systems. AMEC 2003. Lecture Notes in Computer Science(), vol 3048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25947-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25947-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22674-1

  • Online ISBN: 978-3-540-25947-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics