Computationally Convenient Distributional Assumptions for Common-Value Auctions
- Cite this article as:
- Gordy, M.B. Computational Economics (1998) 12: 61. doi:10.1023/A:1008645531911
- 79 Downloads
Although the mathematical foundations of common-value auctions have been well understood since Milgrom and Weber (1982), equilibrium bidding strategies are computationally complex. Very few calculated examples can be found in the literature, and only for highly specialized cases. This paper introduces two sets of distributional assumptions that are flexible enough for theoretical and empirical applications, yet permit straightforward calculation of equilibrium bidding strategies.