Estimation of a Dynamic Auction Game
This paper proposes an estimation method for a repeated auction game under the presence of capacity contraints. The estimation strategy is computationally simple as it does not require solving for the equilibrium of the game. It uses a two stage approach. In the first stage the distribution of bids conditional on state variables is estimated using data on bids, bidder characteristics and contract characteristics. In the second stage, an expression of the expected sum of future profits based on the distribution of bids is obtained, and costs are inferred based on the first order condition of optimal bids. We apply the estimation method to repeated highway construction procurement auctions in the state of California between May 1996 and May 1999. In this market, previously won uncompleted contracts reduce the probability of winning further contracts. We quantify the effect of intertemporal constraints on bidders' costs and on bids. Due to the intertemporal effect and also to bidder asymmetry, the auction can be inefficient. Based on the estimates of costs, we quantify efficiency losses.
|Date of creation:||Dec 2001|
|Publication status:||published as Jofre-Bonet, Mireia and Martin Pesendorfer. "Estimation Of A Dynamic Auction Game," Econometrica, 2003, v71(5,Sep), 1443-1489.|
|Contact details of provider:|| Postal: National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A.|
Web page: http://www.nber.org
More information through EDIRC
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.:
- Kenneth L. Judd, 1998. "Numerical Methods in Economics," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262100711.
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:8626. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.