A Troubled Asset Reverse Auction
The US Treasury has proposed purchasing $700 billion of troubled assets to restore liquidity and solve the current financial crisis, using market mechanisms such as reverse auctions where appropriate. This paper presents a high-level design for a troubled asset reverse auction and discusses the auction design issues. We assume that the key objectives of the auction are to: 1) provide a quick and effective means to purchase troubled assets and increase liquidity; 2) protect the taxpayer by yielding a price for assets related to their value; and 3) offer a transparent rules-based process that minimizes discretion and favoritism. We propose a two-part approach. Part 1. Groups of related securities are purchased in simultaneous descending clock auctions. The auctions operate on a security-by-security basis to avoid adverse selection. To assure that the auction for each security is competitive, the demand for each security is capped at the total quantity offered by all but the largest three sellers. Demand bids from private buyers are also allowed. The simultaneous clock auctions protect the taxpayer by yielding a competitive price for each security and allow bidders to manage liquidity constraints and portfolio risk. The resulting price discovery also improves the liquidity of the securities that are not purchased in the auctions. Part 2. Following Part 1, the remaining quantity is purchased in descending clock auctions in which many securities are pooled together. To minimize adverse selection, reference prices are calculated for each security from a model that includes all of the characteristics of each security including the market information revealed in the security-by-security auctions of Part 1. Bids in the pooled auctions are specified in terms of a percentage of the reference price for each security.
|Date of creation:||2008|
|Date of revision:||2008|
|Publication status:||Published in Working Paper, University of Maryland, September 2008|
|Contact details of provider:|| Postal: Economics Department, University of Maryland, College Park, MD 20742-7211|
Phone: (202) 318-0520
Fax: (202) 318-0520
Web page: http://www.cramton.umd.edu
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.:
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521536721, June.
- Levin, Dan & Kagel, John H & Richard, Jean-Francois, 1996. "Revenue Effects and Information Processing in English Common Value Auctions," American Economic Review, American Economic Association, vol. 86(3), pages 442-60, June.
- Lawrence M. Ausubel & Peter Cramton, 2004.
"Auctioning Many Divisible Goods,"
Papers of Peter Cramton
04jeea, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Alsemgeest, P. & Noussair, C. & Olson, M., 1995.
"Experimental Comparisons of Auctions Under Single and Multi Unit Demand,"
Purdue University Economics Working Papers
1078, Purdue University, Department of Economics.
- Alsemgeest, Paul & Noussair, Charles & Olson, Mark, 1998. "Experimental Comparisons of Auctions under Single- and Multi-Unit Demand," Economic Inquiry, Western Economic Association International, vol. 36(1), pages 87-97, January.
- Paul Milgrom & Robert J. Weber, 1981.
"A Theory of Auctions and Competitive Bidding,"
447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Ausubel Lawrence M & Cramton Peter, 2008.
"Auction Design Critical for Rescue Plan,"
The Economists' Voice,
De Gruyter, vol. 5(5), pages 1-3, September.
- McCabe, Kevin A & Rassenti, Stephen J & Smith, Vernon L, 1990. "Auction Institutional Design: Theory and Behavior of Simultaneous Multiple-Unit Generalizations of the Dutch and English Auctions," American Economic Review, American Economic Association, vol. 80(5), pages 1276-83, December.
- Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014.
"Demand Reduction and Inefficiency in Multi-Unit Auctions,"
Review of Economic Studies,
Oxford University Press, vol. 81(4), pages 1366-1400.
- Lawrence M. Ausubel & Peter Cramton, 1995. "Demand Reduction and Inefficiency in Multi-Unit Auctions," Papers of Peter Cramton 98wpdr, University of Maryland, Department of Economics - Peter Cramton, revised 22 Jul 2002.
- McAfee, R Preston & McMillan, John, 1987. "Auctions and Bidding," Journal of Economic Literature, American Economic Association, vol. 25(2), pages 699-738, June.
- Peter Cramton, 1998.
Papers of Peter Cramton
98eer, University of Maryland, Department of Economics - Peter Cramton, revised 28 Jul 1998.
- Kagel, John H & Levin, Dan, 2001. "Behavior in Multi-unit Demand Auctions: Experiments with Uniform Price and Dynamic Vickrey Auctions," Econometrica, Econometric Society, vol. 69(2), pages 413-54, March.
- McAdams, David, 2007. "Adjustable supply in uniform price auctions: Non-commitment as a strategic tool," Economics Letters, Elsevier, vol. 95(1), pages 48-53, April.
- Kagel, John H & Harstad, Ronald M & Levin, Dan, 1987. "Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study," Econometrica, Econometric Society, vol. 55(6), pages 1275-1304, November.
- Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
- Kagel, John H., 1995. "Cross-game learning: Experimental evidence from first-price and English common value auctions," Economics Letters, Elsevier, vol. 49(2), pages 163-170, August.
When requesting a correction, please mention this item's handle: RePEc:pcc:pccumd:08tara. 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 Cramton)
If references are entirely missing, you can add them using this form.