IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1007.4264.html
   My bibliography  Save this paper

Lowest Unique Bid Auctions

Author

Listed:
  • Marco Scarsini
  • Eilon Solan
  • Nicolas Vieille

Abstract

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.

Suggested Citation

  • Marco Scarsini & Eilon Solan & Nicolas Vieille, 2010. "Lowest Unique Bid Auctions," Papers 1007.4264, arXiv.org.
    • Handle: RePEc:arx:papers:1007.4264
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1007.4264
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brennan C. Platt & Joseph Price & Henry Tappen, 2010. "Pay-to-Bid Auctions," NBER Working Papers 15695, National Bureau of Economic Research, Inc.
    2. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721.
    3. Andrea Gallice, 2009. "Lowest Unique Bid Auctions with Signals," Carlo Alberto Notebooks 112, Collegio Carlo Alberto, revised Sep 2009.
    4. 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-294, March.
    5. repec:awi:wpaper:0471 is not listed on IDEAS
    6. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mohlin, Erik & Östling, Robert & Wang, Joseph Tao-yi, 2015. "Lowest unique bid auctions with population uncertainty," Economics Letters, Elsevier, vol. 134(C), pages 53-57.
    2. Costa-Gomes, Miguel A. & Shimoji, Makoto, 2014. "Theoretical approaches to lowest unique bid auctions," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 16-24.
    3. Eichberger, Jürgen & Vinogradov, Dmitri, 2016. "Efficiency of Lowest-Unmatched Price Auctions," Economics Letters, Elsevier, vol. 141(C), pages 98-102.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrea Gallice, 2010. "Price Reveal Auctions on the Internet," Carlo Alberto Notebooks 147, Collegio Carlo Alberto.
    2. Gallice Andrea, 2016. "Price Reveal Auctions," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(2), pages 485-514, June.
    3. Emiel Maasland & Sander Onderstal, 2006. "Going, Going, Gone! A Swift Tour of Auction Theory and its Applications," De Economist, Springer, vol. 154(2), pages 197-249, June.
    4. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    6. Daniel McFadden, 2009. "The human side of mechanism design: a tribute to Leo Hurwicz and Jean-Jacque Laffont," Review of Economic Design, Springer;Society for Economic Design, vol. 13(1), pages 77-100, April.
    7. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    8. Jeremy Bulow & Paul Klemperer, 2007. "When are Auctions Best?," Economics Papers 2007-W03, Economics Group, Nuffield College, University of Oxford.
    9. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    10. Brânzei, R. & Fragnelli, V. & Meca, A. & Tijs, S.H., 2006. "Two Classes of Cooperative Games Related to One-Object Auction Situations," Discussion Paper 2006-25, Tilburg University, Center for Economic Research.
    11. repec:dau:papers:123456789/7891 is not listed on IDEAS
    12. Robert Östling & Joseph Tao-yi Wang & Eileen Y. Chou & Colin F. Camerer, 2011. "Testing Game Theory in the Field: Swedish LUPI Lottery Games," American Economic Journal: Microeconomics, American Economic Association, vol. 3(3), pages 1-33, August.
    13. Toomas Hinnosaar, 2013. "Penny Auctions are Unpredictable," Carlo Alberto Notebooks 305, Collegio Carlo Alberto.
    14. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    15. Dejan Trifunović & Bojan Ristić, 2013. "Multi-Unit Auctions In The Procurement Of Electricity," Economic Annals, Faculty of Economics and Business, University of Belgrade, vol. 58(197), pages 47-78, April – J.
    16. Forges, Françoise & Orzach, Ram, 2011. "Core-stable rings in second price auctions with common values," Journal of Mathematical Economics, Elsevier, vol. 47(6), pages 760-767.
    17. Bertoletti, Paolo, 2006. "On the reserve price in all-pay auctions with complete information and lobbying games," MPRA Paper 1083, University Library of Munich, Germany.
    18. Li, Zhen & Kuo, Ching-Chung, 2011. "Revenue-maximizing Dutch auctions with discrete bid levels," European Journal of Operational Research, Elsevier, vol. 215(3), pages 721-729, December.
    19. Hitoshi Matsushima, 2007. "Detail-Free Mechanism Design in Twice Iterative Dominance: Large Economies ( Revised version of CARF-F-007(2004) and CARF-F-062(2005); The further revision was subsequently published in "Journal ," CARF F-Series CARF-F-110, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    20. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    21. Bos, Olivier, 2016. "Charity auctions for the happy few," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 83-92.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.