Information and Competition in U.S. Forest Service Timber Auctions
This paper analyzes the role of private information in U.S. Forest Service timber auctions. In these auctions, firms bid a per unit price for each timber species. Total bids are computed by multiplying these prices by Forest Service volume estimates, but payments depend on actual volumes harvested. We develop an equilibrium theory for these auctions. We then relate (ex post) data about volume to (ex ante) bids. We show that bidders have private information about volumes of species and use it as predicted by theory. Differences in bidder estimates appear to affect the allocation of tracts, but competition limits information rents.
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.:
- Che, Y.K., 1991.
"Design Competition through Multidimensional Auctions,"
9123, Wisconsin Madison - Social Systems.
- Yeon-Koo Che, 1993. "Design Competition through Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 24(4), pages 668-680, Winter.
- Haile,P.A., 1999. "Auctions with resale," Working papers 33, Wisconsin Madison - Social Systems.
- Harstad, Ronald M. & Michael H. Rothkopf, 1995.
"An "Alternating Recognition" Model of English Auctions,"
Discussion Paper Serie B
348, University of Bonn, Germany.
- Ronald M. Harstad & Michael H. Rothkopf, 2000. "An "Alternating Recognition" Model of English Auctions," Management Science, INFORMS, vol. 46(1), pages 1-12, January.
When requesting a correction, please mention this item's handle: RePEc:ucp:jpolec:v:109:y:2001:i:2:p:375-417. 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: (Journals Division)
If references are entirely missing, you can add them using this form.