Lowest Unique Bid Auctions

Marco Scarsini, Eilon Solan () and Nicolas Vieille ()

Papers from arXiv.org

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.

Date: 2010-07
New Economics Papers: this item is included in nep-cta and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://arxiv.org/pdf/1007.4264 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1007.4264

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().