Price Reveal Auctions
A price reveal auction (PRA) is a descending price auction in which the current price of the item on sale is hidden. Buyers can privately observe the price only by paying a fee, and every time an agent does so, the price falls by a predetermined amount. We show that if the number of participants, n$$n$$, is common knowledge, then in equilibrium a PRA replicates the outcome of a posted price mechanism. In particular, at most one buyer observes the price and the auction immediately finishes. In contrast, multiple entries can occur and profitability is enhanced when agents are uncertain about n$$n$$. Under some conditions, a PRA may even yield higher expected revenues than standard auction formats.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 16 (2016)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: https://www.degruyter.com|
|Order Information:||Web: https://www.degruyter.com/view/j/bejte|
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.:
- Andrea Gallice & Giuseppe Sorrenti, 2015. "Curious about the price? Consumers' behavior in price reveal auctions," Carlo Alberto Notebooks 432, Collegio Carlo Alberto.
- Brennan C. Platt & Joseph Price & Henry Tappen, 2010. "Pay-to-Bid Auctions," NBER Working Papers 15695, National Bureau of Economic Research, Inc.
- Amnon Rapoport & Hironori Otsubo & Bora Kim & William E. Stein, 2009. "Unique Bid Auction Games," Jena Economic Research Papers 2009-005, Friedrich-Schiller-University Jena.
- Andrea Gallice, 2009. "Lowest Unique Bid Auctions with Signals," Carlo Alberto Notebooks 112, Collegio Carlo Alberto, revised Sep 2009.
- 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.
- Di Gaetano, Luigi, 2011. "A model of descending auction with hidden starting price and endogenous price decrease," MPRA Paper 35773, University Library of Munich, Germany.
- Krishna, Vijay, 2002. "Auction Theory," Elsevier Monographs, Elsevier, edition 1, number 9780124262973.
- Andrea Gallice, 2010. "Price Reveal Auctions on the Internet," Carlo Alberto Notebooks 147, Collegio Carlo Alberto.
- Raviv, Yaron & Virag, Gabor, 2009. "Gambling by auctions," International Journal of Industrial Organization, Elsevier, vol. 27(3), pages 369-378, May.
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:16:y:2016:i:2:p:485-514:n:4. 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: (Peter Golla)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.