Lowest Unique Bid Auctions
We consider a class of auctions (Lowest Unique Bid Auctions) that have achieved a considerable success on the Internet. Bids are made in cents (of euro) and every bidder can bid as many numbers as she wants. The lowest unique bid wins the auction. Every bid has a fixed cost, and once a participant makes a bid, she gets to know whether her bid was unique and whether it was the lowest unique. Information is updated in real time, but every bidder sees only what's relevant to the bids she made. We show that the observed behavior in these auctions differs considerably from what theory would prescribe if all bidders were fully rational. We show that the seller makes money, which would not be the case with rational bidders, and some bidders win the auctions quite often. We describe a possible strategy for these bidders.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hendricks, Kenneth & Weiss, Andrew & Wilson, Charles, 1987.
"The War of Attrition in Continuous Time with Complete Information,"
87-03, C.V. Starr Center for Applied Economics, New York University.
- Hendricks, Ken & Weiss, Andrew & Wilson, Charles A, 1988. "The War of Attrition in Continuous Time with Complete Information," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 29(4), pages 663-80, November.
- Kyle, Albert S, 1985. "Continuous Auctions and Insider Trading," Econometrica, Econometric Society, vol. 53(6), pages 1315-35, November.
- Paul Klemperer, 2004.
"Auctions: Theory and Practice,"
2004-W09, Economics Group, Nuffield College, University of Oxford.
- Baye, Michael R & Kovenock, Dan & de Vries, Casper G, 1993.
"Rigging the Lobbying Process: An Application of the All-Pay Auction,"
American Economic Review,
American Economic Association, vol. 83(1), pages 289-94, March.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1991. "Rigging The Lobbying Process: An Application Of The All- Pay Auction," Purdue University Economics Working Papers 1002, Purdue University, Department of Economics.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1992. "Rigging the Lobbying Process: An Application of the All- Pay Auction," Papers 9-92-2, Pennsylvania State - Department of Economics.
- Raviv, Yaron & Virag, Gabor, 2009. "Gambling by auctions," International Journal of Industrial Organization, Elsevier, vol. 27(3), pages 369-378, May.
- Andrea Gallice, 2009. "Lowest Unique Bid Auctions with Signals," Carlo Alberto Notebooks 112, Collegio Carlo Alberto, revised Sep 2009.
- Amnon Rapoport & Hironori Otsubo & Bora Kim & William E. Stein, 2009. "Unique Bid Auction Games," Jena Economic Research Papers 2009-005, Friedrich-Schiller-University Jena.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521551847.
- Ron Siegel, 2009. "All-Pay Contests," Econometrica, Econometric Society, vol. 77(1), pages 71-92, 01.
- Jürgen Eichberger & Dmitri Vinogradov, 2008. "Least Unmatched Price Auctions: A First Approach," Working Papers 0471, University of Heidelberg, Department of Economics, revised Jul 2008.
- Brennan C. Platt & Joseph Price & Henry Tappen, 2010. "Pay-to-Bid Auctions," NBER Working Papers 15695, National Bureau of Economic Research, Inc.
- Albert S. Kyle, 1989. "Informed Speculation with Imperfect Competition," Review of Economic Studies, Oxford University Press, vol. 56(3), pages 317-355.
- Harold Houba & Dinard van der Laan & Dirk Veldhuizen, 2008. "The Unique-lowest Sealed-bid Auction," Tinbergen Institute Discussion Papers 08-049/1, Tinbergen Institute.
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1007.4264. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators)
If references are entirely missing, you can add them using this form.