Skip to main content

Impersonation Strategies in Auctions

  • Conference paper
Internet and Network Economics (WINE 2010)

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

Included in the following conference series:

Abstract

A common approach to analyzing repeated auctions, such as sponsored search auctions, is to treat them as complete information games, because it is assumed that, over time, players learn each other’s types. This overlooks the possibility that players may impersonate another type. Many standard auctions (including generalized second price auctions and core-selecting auctions), as well as the Kelly mechanism, have profitable impersonations. We define a notion of impersonation-proofness for the auction mechanism coupled with a process by which players learn about each other’s type, and show an equivalence to a problem of dominant-strategy mechanism design.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. Games and Economic Behavior 67(1), 2–21 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ashlagi, I., Tennenholtz, M., Monderer, D.: Robust learning equilibrium. In: Proc. of the 22nd Conference in Uncertainty in Artificial Intelligence, UAI (2006)

    Google Scholar 

  3. Brafman, R.I., Tennenholtz, M.: Efficient learning equilibrium. Artif. Intell. 159(1-2), 27–47 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Day, R., Milgom, P.: Core-selecting package auctions. Int. J. Game Theory 36, 393–407 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Edelman, B., Ostrovsky, M., Schwartz, 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 

  6. Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Math. Oper. Res. 29(3), 407–435 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kelly, F.P.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)

    Article  Google Scholar 

  8. Shoham, Y., Powers, R., Grenager, T.: If multi-agent learning is the answer, what is the question? Arificial Intelligence 171(7), 365–377 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kash, I.A., Parkes, D.C. (2010). Impersonation Strategies in Auctions. In: Saberi, A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17572-5_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17572-5_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17571-8

  • Online ISBN: 978-3-642-17572-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics