Skip to main content Accessibility help
×
Hostname: page-component-5c6d5d7d68-ckgrl Total loading time: 0 Render date: 2024-08-16T06:34:15.134Z Has data issue: false hasContentIssue false

9 - Dynamic auctions in procurement

Published online by Cambridge University Press:  04 November 2009

Lawrence M. Ausubel
Affiliation:
Professor of Economics University of Maryland, USA
Peter Cramton
Affiliation:
Professor of Economics University of Maryland, USA
Nicola Dimitri
Affiliation:
Università degli Studi, Siena
Gustavo Piga
Affiliation:
Università degli Studi di Roma 'Tor Vergata'
Giancarlo Spagnolo
Affiliation:
Stockholm School of Economics
Get access

Summary

Introduction

Procurements for many related items are commonplace. Dynamic auctions have many advantages in such environments. We consider both the purchase of many related items and the purchase of many divisible goods, such as energy products or environmental allowances, or other procurement contracts. In such auctions, the bids specify quantities of each of the items: the megawatt-hours of electricity or the tons of emissions. Often, related goods are – or could be – auctioned at the same time. In electricity markets, products with several durations or locations may be auctioned together. In environmental auctions, emission reductions for each of several different pollutants or time periods may be bought at the same time. This chapter explores how procurement auctions for many divisible or indivisible goods should be conducted. Of course, the answer depends on the objective of the buyer and the bidding environment. Here we focus on a few of the important issues of auction design in a setting where the buyer cares about some combination of efficiency (procuring the goods from the lowest-cost suppliers) and minimization of the payment for purchasing the goods. Our purpose is to motivate a sensible design in a realistic environment, rather than to prove the optimality of a particular design, which would require more restrictive assumptions than we care to make.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ausubel, Lawrence M. (2004). ‘An Efficient Ascending-Bid Auction for Multiple Objects,’ American Economic Review, 94 (5), 1452–1475.CrossRefGoogle Scholar
Ausubel, Lawrence M. (2006). ‘An Efficient Dynamic Auction for Heterogeneous Commodities,’ American Economic Review, 96 (3), 602–629.CrossRef
Ausubel, Lawrence M. and Peter Cramton (2002). ‘Demand Reduction and Inefficiency in Multi-Unit Auctions,’ Working Paper 96–07, University of Maryland.
Ausubel, Lawrence M. and Milgrom, Paul (2002). ‘Ascending Auctions with Package Bidding,’ Frontiers of Theoretical Economics, 1, 1–45, www.bepress.com/bejte/frontiers/vol1/iss1/art1.CrossRefGoogle Scholar
Ausubel, Lawrence M. and Paul Milgrom (2006a). ‘Ascending Proxy Auctions,’ in Cramton, Peter, Shoham, Yoav and Steinberg, Richard (Eds.), Combinatorial Auctions, Chapter 3, 79–98, MIT Press.Google Scholar
Ausubel, Lawrence M. and Paul Milgrom (2006b). ‘The Lovely but Lonely Vickrey Auction,’ in Cramton, Peter, Shoham, Yoav and Steinberg, Richard (Eds.), Combinatorial Auctions, Chapter 1, 17–40, MIT Press.Google Scholar
Ausubel, Lawrence M. and Cramton, Peter (2004a). ‘Auctioning Many Divisible Goods,’ Journal of the European Economic Association, 2, 480–493, April–May.CrossRefGoogle Scholar
Ausubel, Lawrence M. and Cramton, Peter (2004b). ‘Vickrey Auctions with Reserve Pricing,’ Economic Theory, 23, 493–505.CrossRefGoogle Scholar
Ausubel, Lawrence M., Peter C. Cramton, and Wynne P. Jones (2002). ‘System and Method for an Auction of Multiple Types of Items,’ International Patent Application No. PCT/US02/16937.
Ausubel, Lawrence M., Peter Cramton, and Paul Milgrom (2006). ‘The Clock-Proxy Auction: A Practical Combinatorial Auction Design,’ in Cramton, Peter, Shoham, Yoav, and Steinberg, Richard (Eds.), Combinatorial Auctions, Chapter 5, 115–138, MIT Press.Google Scholar
Brusco, Sandro and Giuseppe, Lopomo (2002). ‘Collusion via Signalling in Simultaneous Ascending Bid Auctions with Heterogeneous Objects, with and without Complementarities’, Review of Economic Studies, 69, 407–436.CrossRefGoogle Scholar
Compte, Olivier and Philippe Jehiel (2002). ‘Auctions and Information Acquisition: Sealed-bid or Dynamic Formats?’ Working paper, CERAS-ENPC.
Cramton, Peter (1997). ‘The FCC Spectrum Auctions: An Early Assessment,’ Journal of Economics and Management Strategy 6(3), 431–495.CrossRefGoogle Scholar
Cramton, Peter (2006). ‘Simultaneous Ascending Auctions,’ in Cramton, Peter, Shoham, Yoav and Steinberg, Richard (Eds.), Combinatorial Auctions, Chapter 4, 99–114, MIT Press.Google Scholar
Cramton, Peter and Schwartz, Jesse (2002). ‘Collusive Bidding in the FCC Spectrum Auctions,’ Contributions to Economic Analysis & Policy, 1(1), www.bepress.com/bejeap/contributions/vol1/iss1/art11.Google Scholar
Cramton, Peter, Shoham, Yoav and Steinberg, Richard (2006). Combinatorial Auctions, Cambridge, MA: MIT Press.Google Scholar
Day, Robert W. and Raghavan, S. (2004). ‘Generation and Selection of Core Outcomes in Sealed-Bid Combinatorial Auctions,’ Working paper, University of Maryland.Google Scholar
Veronika, Grimm, Riedel, Frank, and Wolfstetter, Elmar (2002). ‘Low Price Equilibrium in Multi-unit Auctions: The GSM Spectrum Auction in Germany,’ International Journal of Industrial Organization, 21, 1557–1569.Google Scholar
Hoffman, Karla, Dinesh Menon, Susara van den Heever, and Thomas Wilson (2006). ‘Observations and Near-Direct Implementations of the Ascending Proxy Auction,’ in Cramton, Peter, Shoham, Yoav, and Steinberg, Richard (Eds.), Combinatorial Auctions, Chapter 17, 415–450, MIT Press.Google Scholar
McAdams, David (2005). ‘Adjustable Supply in Uniform Price Auctions: The Value of Non-Commitment,’ Working paper, MIT.Google Scholar
Milgrom, Paul (2004). Putting Auction Theory to Work, Cambridge: Cambridge University Press.CrossRefGoogle Scholar
Milgrom, Paul and Weber, Robert J. (1982). ‘A Theory of Auctions and Competitive Bidding,’ Econometrica, 50, 1089–1122.CrossRefGoogle Scholar
Parkes, David C. and Lyle H. Ungar (2000). ‘Iterative Combinatorial Auctions: Theory and Practice,’ Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00), 74–81, Austin, Texas, 2000.
David, Porter, Rassenti, Stephen, Roopnarine, Anil and Smith, Vernon (2003). ‘Combinatorial Auction Design,’ Preceedings of the National Academy of Sciences, 100, 11153–11157.Google Scholar
William, Vickrey (1961). ‘Counterspeculation, Auctions, and Competitive Sealed Tenders,’ Journal of Finance, 16, 8–37.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×