Skip to main content

Equilibrium Analysis of Dynamic Bidding in Sponsored Search Auctions

  • Conference paper
Book cover Internet and Network Economics (WINE 2007)

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

Included in the following conference series:

Abstract

We analyze symmetric pure strategy equilibria in dynamic sponsored search auction games using simulations by restricting the strategies to several in a class introduced by Cary et al. [1]. We show that a particular convergent strategy also exhibits high stability to deviations. On the other hand, a strategy which yields high payoffs to all players is not sustainable in equilibrium play. Additionally, we analyze a repeated game in which each stage is a static complete-information sponsored search game. In this setting, we demonstrate a collusion strategy which yields high payoffs to all players and empirically show it to be sustainable over a range of settings.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cary, M., Das, A., Edelman, B., Giotis, I., Heimerl, K., Karlin, A.R., Mathieu, C., Schwarz, M.: Greedy bidding strategies for keyword auctions. In: Eighth ACM Conference on Electronic Commerce (2007)

    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 9(1), 242–259 (2007)

    Article  Google Scholar 

  3. Feng, J., Zhang, X.: Dynamic price competition on the internet: advertising auctions. In: Eighth ACM Conference on Electronic Commerce, pp. 57–58 (2007)

    Google Scholar 

  4. Krishna, V.: Auction Theory, 1st edn. Academic Press, San Diego (2002)

    Google Scholar 

  5. Lahaie, S.: An analysis of alternative slot auction designs for sponsored search. In: Seventh ACM Conference on Electronic Commerce (2006)

    Google Scholar 

  6. Lahaie, S., Pennock, D.M.: Revenue analysis of a family of ranking rules for keyword auctions. In: Eighth ACM Conference on Electronic Commerce (2007)

    Google Scholar 

  7. Liang, L., Qi, Q.: Cooperative or vindictive: bidding strategies in sponsored search auctions. In: Third International Workshop on Internet and Network Economics. LNCS, Springer, Heidelberg (2007)

    Google Scholar 

  8. Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)

    Google Scholar 

  9. Varian, H.: Position auctions. International Journal of Industrial Organization ( to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Xiaotie Deng Fan Chung Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vorobeychik, Y., Reeves, D.M. (2007). Equilibrium Analysis of Dynamic Bidding in Sponsored Search Auctions. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77105-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77104-3

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics