skip to main content
article

The effects of proxy bidding and minimum bid increments within eBay auctions

Published:01 August 2007Publication History
Skip Abstract Section

Abstract

We present a mathematical model of the eBay auction protocol and perform a detailed analysis of the effects that the eBay proxy bidding system and the minimum bid increment have on the auction properties. We first consider the revenue of the auction, and we show analytically that when two bidders with independent private valuations use the eBay proxy bidding system there exists an optimal value for the minimum bid increment at which the auctioneer's revenue is maximized. We then consider the sequential way in which bids are placed within the auction, and we show analytically that independent of assumptions regarding the bidders' valuation distribution or bidding strategy the number of visible bids placed is related to the logarithm of the number of potential bidders. Thus, in many cases, it is only a minority of the potential bidders that are able to submit bids and are visible in the auction bid history (despite the fact that the other hidden bidders are still effectively competing for the item). Furthermore, we show through simulation that the minimum bid increment also introduces an inefficiency to the auction, whereby a bidder who enters the auction late may find that its valuation is insufficient to allow them to advance the current bid by the minimum bid increment despite them actually having the highest valuation for the item. Finally, we use these results to consider appropriate strategies for bidders within real world eBay auctions. We show that while last-minute bidding (sniping) is an effective strategy against bidders engaging in incremental bidding (and against those with common values), in general, delaying bidding is disadvantageous even if delayed bids are sure to be received before the auction closes. Thus, when several bidders submit last-minute bids, we show that rather than seeking to bid as late as possible, a bidder should try to be the first sniper to bid (i.e., it should “snipe before the snipers”).

References

  1. Anthony, P. and Jennings, N. R. 2003. Developing a bidding agent for multiple heterogeneous auctions. ACM Trans. Internet Tech. 3, 3, 185--217. Google ScholarGoogle Scholar
  2. Bajari, P. and Hortacsu, A. 2003. The winners curse, reserve prices, and endogenous entry: Empirical insights from eBay auctions. RAND J. Econ. 34, 2, 329--355.Google ScholarGoogle Scholar
  3. Bajari, P. and Hortacsu, A. 2004. Economic insights from internet auctions. J. Econ. Lit. 42, 457--486.Google ScholarGoogle Scholar
  4. Bapna, R. 2003. When snipers become predators: Can mechanism design save online auctions? Commun. ACM 46, 12, 152--158. Google ScholarGoogle Scholar
  5. Barbaro, S. and Bracht, B. 2004. Shilling, squeezing, sniping: Explaining late bidding in online second-price auctions. Working article. University of Mainz, Mainz, Germany.Google ScholarGoogle Scholar
  6. David, E., Rogers, A., Schiff, J., Kraus, S., and Jennings, N. R. 2005. Optimal design of English auctions with discrete bid levels. In Proceedings of the ACM Conference on Electronic Commerce. 98--107. Google ScholarGoogle Scholar
  7. David, E., Rogers, A., Jennings, N. R., Schiff, J., Kraus, S., and Rothkopf, M. H. 2007. Optimal design of English auctions with discrete bid levels. ACM Trans. Inte. Tech. 7, 2, Article 12 (May 2007), 34 pages. DOI = 10.1145/1239971.1239976 http://doi.acm.org/101145/1239971.1239976 Also available online at http://eprints.ecs.soton.ac.uk/11548/. Google ScholarGoogle Scholar
  8. Dumas, M., Aldred, L., Governatori, G., Hofstede, A., and Russel, N. 2002. A probabilistic approach to automated bidding in alternative auctions. In Proceedings of the 11th International World Wide Web Conference. 99--108. Google ScholarGoogle Scholar
  9. eBay. 2006. Financial releases: Fourth quarter and full year 2006 financial results. Available online at http://investor.ebay.com/.Google ScholarGoogle Scholar
  10. Engelberg, J. and Williams, J. 2005. A license to shill: Incremental bidding and eBay's proxy system. Working article. Kellogg School of Management, Northwestern University, Evanston, IL.Google ScholarGoogle Scholar
  11. Fontoura, M., Ionescu, M., and Minsky, N. 2002. Law-governed peer-to-peer auctions. In Proceedings of the 11th International World Wide Web Conference. 109--117. Google ScholarGoogle Scholar
  12. Gerding, E., Rogers, A., Dash, R. K., and Jennings, N. R. 2007. Sellers competing for buyers in online markets: Reserve prices, shill bids, and auction fees. In Proceedings of the 20th International Joint Conference on Artificial Intelligence. 1287--1293. Google ScholarGoogle Scholar
  13. Guo, X. 2002. An optimal strategy for sellers in an online auction. ACM Trans. Internet Tech. 2, 1, 1--13. Google ScholarGoogle Scholar
  14. Haile, P. A. and Tamer, E. 2003. Inference with an incomplete model of English auctions. J. Pol. Econ. 11, 1, 1--51.Google ScholarGoogle Scholar
  15. Harstad, R. M. and Rothkopf, M. H. 2000. An ‘alternating recognition’ model of English auctions. Manag. Sci. 46, 1--12. Google ScholarGoogle Scholar
  16. Hossain, T. and Morgan, J. 2006. ..Plus shipping and handling: Revenue (non)equivalence in field experiments on eBay. Advan. Econ. Analys. Policy 6, 2, article 3.Google ScholarGoogle Scholar
  17. Jiang, A. X. and Leyton-Brown, K. 2007. Bidding agents for online auctions with hidden bids. Mach. Learn. J. 67, 1/2(May), 117--143. Google ScholarGoogle Scholar
  18. Johansson, K. 1998. The longest increasing subsequence in a random permutation and a unitary random matrix model. Math. Res. Lett. 5, 63--82.Google ScholarGoogle Scholar
  19. Lucking-Reiley, D. H. 2000. Auctions on the internet: What's being auctioned, and how? J. Indust. Econ. 48, 3, 227--252.Google ScholarGoogle Scholar
  20. Milgrom, P. R. and Weber, R. J. 1982. A theory of auctions and competitive bidding. Econometrica 50, 5, 1089--1122.Google ScholarGoogle Scholar
  21. Ockenfels, A., Reiley, D., and Sadrieh, A. 2007. Online auctions. In Economics and Information Systems, T. Hendershott, Ed. Elsevier, Amsterdam, The Netherlands, 571--628.Google ScholarGoogle Scholar
  22. Ockenfels, A. and Roth, A. E. 2006. Late and multiple bidding in second-price internet auctions: Theory and evidence concerning different rules for ending an auction. Games Econ. Behav. 55, 297--320.Google ScholarGoogle Scholar
  23. Riley, J. G. and Samuelson, W. F. 1981. Optimal auctions. Amer. Econ. Rev. 71, 381--392.Google ScholarGoogle Scholar
  24. Roth, A. E. and Ockenfels, A. 2003. Last-minute bidding and the rules for ending second-price auctions: Evidence from eBay and Amazon auctions on the Internet. Amer. Econ. Rev. 92, 4, 1093--1103.Google ScholarGoogle Scholar
  25. Rothkopf, M. H. and Harstad, R. M. 1994. On the role of discrete bid levels in oral auctions. Eur. J. Operat. Res. 74, 572--581.Google ScholarGoogle Scholar
  26. Shah, H. S., Joshi, N. R., Sureka, A., and Wurman, P. R. 2003. Mining ebay: Bidding strategies and shill detection. In Proceedings of the Conference on Mining Web Data for Discovering Usage Patterns and Profiles (WEBKDD 2002). 17--34.Google ScholarGoogle Scholar
  27. Song, U. 2004. Nonparametric estimation of an eBay auction model. Working article. Department of Economics, University of British Columbia, Vancouver, B.C. Canada.Google ScholarGoogle Scholar

Index Terms

  1. The effects of proxy bidding and minimum bid increments within eBay auctions

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader