Unconditional Competitive Auctions with Copy and Budget Constraints

  • Conference paper
Internet and Network Economics (WINE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4286))

Included in the following conference series:

Abstract

This paper investigates a new auction model in which bidders have both copy and budget constraints. The new model has extensive and interesting applications in auctions of online ad-words, software licenses, etc. We consider the following problem: Suppose all the participators are rational, how to allocate the objects at what price so as to guarantee auctioneer’s high revenue, and how high it is.

We introduce a new kind of mechanisms called win-win mechanisms and present the notion of unconditional competitive auctions. A notably interesting property of win-win mechanisms is that each bidder’s self-interested strategy brings better utility not only to himself but also to the auctioneer. Then we present win-win mechanisms for multi-unit auctions with copy and budget constraints. We prove that these auctions are unconditional competitive under the situation of both limited and unlimited supply.

Research is supported by a research grant of City University of Hong Kong (Proj. No. 7001838).

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abrams, Z.: Revenue maximization when bidders have budgets. In: Proceedings of the seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, FL, January 22–26, pp. 1074–1082. ACM Press, New York (2006)

    Chapter  Google Scholar 

  2. Borgs, C., Chayes, J.T., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget-constrained bidders. In: ACM Conference on Electronic Commerce (EC 2005), pp. 44–51 (2005)

    Google Scholar 

  3. Bu, T.-M., Qi, Q., Sun, A.W.: Unconditional competitive auctions with copy and budget constraints. Full version, Available at: http://www.cs.cityu.edu.hk/~deng/

  4. Che, Y.-K., Gale, I.: Standard auctions with financially constrained bidders. Review of Economic Studies 65(1), 1–21 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, X., Deng, X., Liu, B.J.: On incentive compatible competitive selection protocol. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 13–22. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 11–33 (1971)

    Article  Google Scholar 

  7. Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of dollars worth of keywords, Available at: http://www.nber.org/papers/w11765.pdf

  8. Fiat, A., Goldberg, A.V., Hartline, J.D., Karlin, A.R.: Competitive generalized auctions. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), May 19–21, pp. 72–81. ACM Press, New York (2002)

    Chapter  Google Scholar 

  9. Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), January 7–9, pp. 735–744. ACM Press, New York (2001)

    Google Scholar 

  10. Groves, T.: Incentives in teams. Econometrica 41, 617–631 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kao, M.-Y., Li, X.-Y., Wang, W.: Output truthful versus input truthful: A new concept for algorithmic mechanism design (2006)

    Google Scholar 

  12. Laffont, J.-J., Robert, J.: Optimal auction with financially constrained buyers. Economics Letters 52, 181–186 (1996)

    Article  MATH  Google Scholar 

  13. Leonard, H.B.: Elicitation of honest preferences for the assignment of individuals to positions. The Journal of Political Economy 91, 461–479 (1983)

    Article  Google Scholar 

  14. Maskin, E.S.: Auctions, development, and privatization: Efficient auctions with liquidity-constrained buyers. European Economic Review 44(4–6), 667–681 (2000)

    Article  Google Scholar 

  15. Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce (EC 2000), October 17–20, pp. 242–252. ACM Press, New York (2000)

    Chapter  Google Scholar 

  16. Shapley, L.S., Shubik, M.: The assignment game i: the core. International Journal of Game Theory 1, 111–130 (1972)

    Article  MathSciNet  Google Scholar 

  17. Vickery, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance XVI, 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

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bu, TM., Qi, Q., Sun, A.W. (2006). Unconditional Competitive Auctions with Copy and Budget Constraints. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_3

Download citation

  • DOI: https://doi.org/10.1007/11944874_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68138-0

  • Online ISBN: 978-3-540-68141-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation