Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-ttngx Total loading time: 0 Render date: 2024-05-27T21:32:00.298Z Has data issue: false hasContentIssue false

19 - A New and Improved Design for Multi-Object Iterative Auctions

from Part III - Alternative Auction Designs

Published online by Cambridge University Press:  26 October 2017

Anthony M. Kwasnica
Affiliation:
Smeal College of Business, The Pennsylvania State University
John O. Ledyard
Affiliation:
Division of the Humanities and Social Sciences, California Institute of Technology
David P. Porter
Affiliation:
Economic Science Institute, Chapman University
Christine DeMartini
Affiliation:
Division of the Humanities and Social Sciences, California Institute of Technology
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

Introduction

Theory, experiment and practice suggest that, when bidder valuations for multiple objects are super-additive, combinatorial auctions are needed to increase efficiency, seller revenue, and bidder willingness to participate (Bykowsky et al. 2000, Rassenti et al. 1982, Ledyard et al. 2002). A combinatorial auction is an auction in which bidders are allowed to express bids in terms of packages of objects. The now famous FCC spectrum auctions are a good example of the relevance of these issues. In 41 auction events from 1994 to 2003, the FCC used what is known as a Simultaneous Multiple Round (SMR) auction to allocate spectrum and raise over $40 billion in revenue. This auction format does not allow package bidding. The FCC auctions also divide the spectrum by geographic location. It is reasonable to expect that some bidders might receive extra benefits by obtaining larger, more contiguous portions of the spectrum. A firm might enjoy cost savings if they could purchase two adjacent locations. However, without package bidding, a bidder cannot express that preference, potentially lowering the efficiency and revenue of the auction. If the bidder attempts to acquire both licenses through bidding on the licenses individually, they might be forced to expose themselves to potential losses. The high number of bidder defaults on payments might, in part, be evidence of losses caused by the lack of package bidding. In response to these difficulties, the FCC plans to allow package bidding in future auctions (Federal Communications Commission 2002, Dunford et al. 2001). In particular, the FCC in its auction #31 for the upper 700 MHz band, affords bidders the ability to submit bids for packages of licenses. The particular design presented in this paper was developed prior to the FCC package auction design. Indeed one of the major features of the FCC design was clearly influenced by the pricing rules we developed herein.

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

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

Andersson, A., M., Tenhunen, F., Ygge. 2000. Integer programming for combinatorial auction winner determination. Proceeding of the Fourth International Conference on Multiagent Systems.
Armstrong, M. 2000. Optimal multi-object auctions. Review of Economic Studies 67 (3), 455–81.Google Scholar
Ausubel, L., P., Milgrom. 2002. Ascending auctions with package bidding. Frontiers of TheoreticalEconomics 1 (1).Google Scholar
Banks, J.S., J. O., Ledyard, D. P., Porter. 1989. Allocating uncertain and unresponsive resources: an experimental approach. Rand Journal of Economics 20 (1), 1–25.Google Scholar
Bikhchandani, S., J. M., Ostroy. 2002. The package assignment model. Journal of Economic Theory 107 (2), 377–406.Google Scholar
Bykowsky, M.M., R. J., Cull, J. O., Ledyard. 2000. Mutually destructive bidding: The FCC auction problem. Journal of Regulatory Economics 17 (3), 205–28.Google Scholar
Conen, W., T., Sandholm. 2001. Preference elicitation in combinatorial auctions: Extended abstract’.
Coppinger, V.M., V. L., Smith, J. A., Titus. 1980. Incentives and behavior in english, dutch and sealedbid auctions. Economic Inquiry 43, 1–22.Google Scholar
Cybernomics. 2000. An experimental comparison of the simultaneous multiple round auctions and the CRA combinatorial auction, Technical report. Report to the Federal Communications Commission.
Dasgupta, P., E., Maskin. 2000. Efficient auctions. Quarterly Journal of Economics 115 (2), 341–388.Google Scholar
Davenport, A.J., C., An, E., Ng, G., Hohner G., Reid H., Soo, J. R. Kalagnanam, Rich J. 2003. Combinatorial and quantity-discount procurement auctions benefit mars, incorporated and its suppliers.Interfaces 33, 23–35.Google Scholar
DeMartini, C., A., Kwasnica J., Ledyard D., Porter. 1999. A new and improved design for multiobject iterative auctions, Social Science Working Paper 1054, California Institute of Technology, Pasadena, CA.
Dunford, M., M. Durbin, K. Hoffman, D. Menon, R. Sultana, T. Wilson. 2001. Issues in scaling up the 700 MHz auction design. http://wireless.fcc.gov/auctions/conferences/combin2001/ presentations.html. Presentation.
Federal Communications Commission 2002. Auction of licenses in the 747–762 and 777–792 MHz bands scheduled for june 19, 2002: Further modification of package bidding procedures and other producerdures for auction no. 31, Technical Report AUC-02-31-B, Federal Communications Commission.
Ferejohn, J., R., Forsythe R., Noll. 1979. An experimental analysis of decision making procedures for discrete public goods: A case study of a problem in institutional design, in V. L., Smith, ed., Research in Experimental Economics. Vol. 1, JAI Press, pp. 1–58.
Graves, R., L., Schrage J., Sankaran. 1993. An auction method for course registration. Interfaces 23 (5), 81–92.Google Scholar
Grether, D., M., Isaac C., Plott. 1981. The allocation of landing rights by unanimity among competitors. American Economic Review 71, 166–171.Google Scholar
Groves, T., J., Ledyard. 1977a. Some limitations of demand-revealing processes. Public Choice 29 (2), 107–124. Special Supplement to Spring 1977 Issue.Google Scholar
Groves, T., J., Ledyard. 1977b. Some limitations of demand-revealing processes–reply. Public Choice 29 (2), 139–143. Special Supplement to Spring 1977 Issue.Google Scholar
Ishikida, T., J., Ledyard, M., Olson D., Porter. 2001. The design of a pollution trading system for souther california's RECLAIM emissions trading program, in R. M., Isaac, ed., Research in Experimental Economics. Greenwich, CT.
Kagel, J.H., R. M., Harstad, D., Levin. 1987. Information impact and allocation rules in auctions with affiliated private values: A laboratory study. Econometrica 55, 1275–1304.Google Scholar
Kwasnica, A.M., J. O., Ledyard, D., Porter J., Scott. 1998. The design of multi-object multi-round auctions, Social Science Working Paper 1045, California Institute of Technology, Pasadena, CA.
Larson, K., T., Sandholm. 2001a. Computationally limited agents in auctions, in AGENTS-01 Workshop of Agents for B2B. pp. 27–34.Google Scholar
Larson, K., T., Sandholm. 2001b. Costly valuation computation in auctions. TARK: TheoreticalAspects of Reasoning about Knowledge 8.Google Scholar
Ledyard, J.O., M., Olson D., Porter, J. A., Swanson, D. P., Torma. 2002. The first use of a combined value auction for transportation services. Interfaces 32 (5), 4–12.Google Scholar
Ledyard, J.O., D., Porter A., Rangel. 1997. Experiments testing multiobject allocation mechanisms. Journal of Economics and Management Strategy 6, 639–675.Google Scholar
Milgrom, P.R. 2000. Putting auction theory to work: The simultaneous ascending auction. Journalof Political Economy 108 (2), 245–272.Google Scholar
Milgrom, P.R., R. J., Weber. 1982. A theory of auctions and competitive bidding. Econometrica 50 (5), 1089–1122.Google Scholar
Myerson, R.B. 1981. Optimal auction design. Mathematics of Operations Research 6, 58–73.Google Scholar
Nisan, N. 2000. Bidding and allocation in combinatorial auctions, in ACM Conference on Electronic Commerce. pp. 1–12.
Nisan, N., I., Segal. 2003. The communication requirements of efficient allocations and supporting lindahl prices. manuscript.
Parkes, D.C. 1999. iBundle: An efficient ascending price bundle auction, in Proceeding ACM Conference on Electronic Commerce. pp. 148–57.
Plott, C.R. 1997. Laboratory experimental testbeds: Applications to the PCS auction. Journal ofEconomics & Management Strategy 6, 605–638.Google Scholar
Porter, D.P. 1999. The effect of bid withdrawl in a multi-object auction. Review of Economic Design 4 (1), 73–97.Google Scholar
Rassenti, S.J., V. L., Smith, R. L., Bulfin. 1982. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics 13, 402–417.Google Scholar
Rothkopf, M.H., A., Pekec, R. M., Harstad. 1998. Computationally manageable combinatorial auctions. Management Science 44 (8), 1131–1147.Google Scholar
Sandholm, T. 2000. Issues in computational Vickrey auctions. International Journal of ElectronicCommerce 4 (3), 107–129.Google Scholar
Sandholm, T. 2002a.Algorithm for optimal winner determination in combinatorial auctions. ArtificialIntelligence 135 (1–2), 1–54.Google Scholar
Sandholm, T. 2002b. eMediator : a next generation electronic commerce server. Computational Intelligence 18 (4), 656–676. Special Issue on Agent Technology for Electronic Commerce.Google Scholar
Sandholm, T., S., Suri A., Gilpin D., Levine. 2001. Cabob: A fast optimal algorithm for combinatorial auctions, in International Joint Conference on Artificial Intelligence. pp. 1102–8.
Siegel, S., N. J., Castellan. 1988. Nonparametric Statistic for the Behavioral Sciences, McGraw-Hill.
Smith, V.L. 1979. Incentive compatible experimental processes for the provision of public goods, in V. L., Smith, ed., Research in Experimental Economics. Vol. 1, JAI Press, pp. 59–168.
Williams, S. 1999. A characterization of efficient, bayesian incentive compatible mechanisms. EconomicTheory 14 (1), 155–80.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
×