Skip to main content

Multi-bidding Strategy in Sponsored Keyword Auction

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5059))

Abstract

The generalized second price auction has recently become a much studied model for sponsored keyword auctions for Internet advertisement. Though it is known not to be incentive compatible, properties of its pure Nash equilibria have been well characterized under the single bidding strategy of each bidder.

In this paper, we study the properties of pure Nash equilibria of the generalized second price auction when each bidder is allowed to submit more than one bid. This multi-bidding strategy is noted to have been adopted by companies for keyword advertisements on search engines. In consideration of the pure Nash equilibria, we completely characterize conditions on the number of selling slots for a pure Nash equilibrium to exist, assuming all the advertisers are allowed to use multi-bidding strategies or only one advertiser will use a multi-bidding strategy.

Our findings reveal interesting properties of limitation and potentials of the market place of online advertisement.

We would like to thank the anonymous referees for constructive suggestions.

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. Varian, H.R.: Position auctions. International Journal of Industrial Organization 25(6), 1163–1178 (2007)

    Article  Google Scholar 

  2. Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review 97(1), 242–259 (2007)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. In: Proceedings of the 7th ACM Conference on Electronic Commerce (EC 2006), Ann Arbor, Michigan, USA, June 11–15, pp. 1–7 (2006)

    Google Scholar 

  7. Zhou, Y., Lukose, R.: Vindictive bidding in keyword auctions. In: Second Workshop on Sponsored Search Auctions, in conjunction with the ACM Conference on Electronic Commerce (EC 2006), Ann Arbor, Michigan, June 11 (2006)

    Google Scholar 

  8. Bu, T.M., Deng, X., Qi, Q.: Forward looking nash equilibrium for keyword auction. Information Processing Letters 105(2), 41–46 (2008)

    Article  MathSciNet  Google Scholar 

  9. Bu, T.M., Deng, X., Qi, Q.: Dynamics of strategic manipulation in ad-words auction. In: Third Workshop on Sponsored Search Auctions, in conjunction with WWW 2007, Banff, Canada, May 8–12 (2007)

    Google Scholar 

  10. Cary, M., Das, A., Edelman, B., Giotis, I., Heimerl, K., Karlin, A.R., Mathieu, C., Schwarz, M.: Greedy bidding strategies for keyword auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC 2007), San Diego, California, USA, June 11–15, pp. 262–271 (2007)

    Google Scholar 

  11. Sakurai, Y., Yokoo, M., Matsubara, S.: A limitation of the generalized vickrey auction in electronic commerce: Robustness against false-name bids. In: Proceedings of the 6th National Conference on Artificial Intelligence (AAAI 1999); Proceedings of the 11th Conference on Innovative Applications of Artificial Intelligence, Menlo Park, Cal, July 18–22, pp. 86–92 (1999)

    Google Scholar 

  12. Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false-name declarations in mechanism design: Towards collective decision making on the internet. In: Proceedings of the 20th International Conference on Distributed Computing Systems (ICDCS 2000), April 2000, pp. 146–153 (2000)

    Google Scholar 

  13. Lambert, N.S., Shoham, Y.: Asymptotically optimal repeated auctions for sponsored search. In: Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, Minneapolis, USA, August 19–22, pp. 55–64 (2007)

    Google Scholar 

  14. Deng, X., Iwama, K., Qi, Q., Sun, A.W., Tasaka, T.: Properties of Symmetric Incentive Compatible Auctions. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 264–273. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franco P. Preparata Xiaodong Wu Jianping Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bu, TM., Deng, X., Qi, Q. (2008). Multi-bidding Strategy in Sponsored Keyword Auction. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69311-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69310-9

  • Online ISBN: 978-3-540-69311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics