Should Auctions be Transparent?
We investigate the role of market transparency in repeated first-price auctions. We consider a setting with private and independent values across bidders. The values are assumed to be perfectly persistent over time. We analyze the first-price auction under three distinct disclosure regimes regarding the bid and award history. Of particular interest is the minimal disclosure regime, in which each bidder only learns privately whether he won or lost the auction at the end of each round. In equilibrium, the winner of the initial auction lowers his bids over time, while losers keep their bids constant, in anticipation of the winner’s lower future bids. This equilibrium is efficient, and all information is eventually revealed. Importantly, this disclosure regime does not give rise to pooling equilibria. We contrast the minimal disclosure setting with the case in which all bids are public, and the case in which only the winner’s bids are public. In these settings, an inefficient pooling equilibrium with low revenues always exists with a sufficiently large number of bidders.
|Date of creation:||Aug 2010|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
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.:
- Albaek, Svend & Mollgaard, Peter & Overgaard, Per B, 1997.
"Government-Assisted Oligopoly Coordination? A Concrete Case,"
Journal of Industrial Economics,
Wiley Blackwell, vol. 45(4), pages 429-443, December.
- Svend Albæk & Peter Møllgaard & Per Baltzer Overgaard, 1997. "Government-Assisted Oligopoly Coordination? A Concrete Case," CIE Discussion Papers 1997-03, University of Copenhagen. Department of Economics. Centre for Industrial Economics.
- Blume, Andreas, 2003. "Bertrand without fudge," Economics Letters, Elsevier, vol. 78(2), pages 167-168, February.
- Kleijnen, J.P.C. & van Schaik, F.D.J., 2007. "Sealed-Bid Auction of Dutch Mussels : Statistical Analysis," Discussion Paper 2007-83, Tilburg University, Center for Economic Research.
- Jacob Rubinstein & Elmar Wolfstetter & Michael Landsberger & Shmuel Zamir, 2001. "First-price auctions when the ranking of valuations is common knowledge," Review of Economic Design, Springer;Society for Economic Design, vol. 6(3), pages 461-480.
- M. Landsberger & J. Rubinstein & E. Wolfstetter & S. Zamir, 1996. "First-Price Auctions when the Ranking of Valuations is Common Knowledge," SFB 373 Discussion Papers 1996,36, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
- Michael Landsberger & Jacob Rubinstein & Elmar Wolfstetter & Shmuel Zamir, 1999. "First-Price Auctions when the Ranking of Valuations is Common Knowledge," Working Papers 99-18, Centre de Recherche en Economie et Statistique.
- Charles J. Thomas, 2010. "INFORMATION REVELATION AND BUYER PROFITS IN REPEATED PROCUREMENT COMPETITION -super-," Journal of Industrial Economics, Wiley Blackwell, vol. 58(1), pages 79-105, 03.
- Estelle Cantillon & Martin Pesendorfer, 2006. "Auctioning bus routes: the London experience," ULB Institutional Repository 2013/9003, ULB -- Universite Libre de Bruxelles.
- Chwe, Michael Suk-Young, 1989. "The discrete bid first auction," Economics Letters, Elsevier, vol. 31(4), pages 303-306, December. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1764. 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: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.