Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-17T03:39:48.559Z Has data issue: false hasContentIssue false

28 - On the Impact of Package Selection in Combinatorial Auctions: An Experimental Study in the Context of Spectrum Auction Design

from Part IV - Experimental Comparisons of Auction Designs

Published online by Cambridge University Press:  26 October 2017

Tobias Scheffel
Affiliation:
Department of Informatics, Technical University of Munich
Georg Ziegler
Affiliation:
Department of Informatics, Technical University of Munich
Martin Bichler
Affiliation:
Department of Informatics, Technical University of Munich
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

Introduction

Designing combinatorial auction (CA) markets is a formidable task: Many theoretical results are negative in the sense that it seems quite unlikely to design fully efficient and practically applicable CAs with a strong game-theoretical solution concept (Cramton et al., 2006a). Experimental research has shown that iterative combinatorial auction (ICA) formats with linear prices achieve very high levels of efficiency (Porter et al., 2003; Kwasnica et al., 2005; Brunner et al., 2009; Scheffel et al., 2010). Most of these experiments are based on value models with only a few items of interest. While it is important to understand bidder behavior in small CAs, we need to know whether the promising results carry over to larger auctions, since applications of CAs can easily have more than 10 items. We ran laboratory experiments with those CA formats that have been used or analyzed for the sale of spectrum licenses, the most prominent and most thoroughly investigated application domain for CAs. However, the analysis is not restricted to spectrum sales and the results are also relevant to the design of auctions in other domains, such as procurement and transportation.We do not only observe which package bids bidders submit, but also which packages they evaluate. Interestingly, we find that auction design rules matter, but the cognitive barriers of bidders, i.e. the number of packages they evaluate, are the biggest barriers to full efficiency. These cognitive barriers have not been an issue in the experimental literature so far.

Spectrum auctions

There has been a long and ongoing discussion on appropriate auction mechanisms for the sale of spectrum rights in the USA (Porter and Smith, 2006). Since 1994, more than 70 spectrum auctions were run using the simultaneous multiround auction (SMR), an auction format which is based on work by Paul Milgrom, Robert Wilson, and Preston McAfee (Milgrom, 2000). While in the SMR auction several items are sold in a single auction, package bidding is not allowed. This leads to a number of strategic problems for bidders (Cramton, 2013), such as limited substitution of spectrum due to the activity rules employed and the exposure problem. The latter refers to the phenomenon that a bidder is exposed to the possibility that he may end up winning a collection of licenses that he does not want at the prices he has bid, because the complementary licenses have become too expensive.

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

Ausubel, L, Milgrom, P (2006) The lovely but lonely Vickrey auction. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial Auctions, MIT Press, Cambridge, MA
Ausubel, L, Cramton, P, Milgrom, P (2006) The clock-proxy auction: A practical combinatorial auction design. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial Auctions, MIT Press, Cambridge, MA
Ausubel, LM, Cramton, P, McAfee, RP, McMillan, J (1997) Synergies in wireless telephony: Evidence from the broadband PCS auctions. Journal of Economics and Management Strategy 6(3):497–527 CrossRefGoogle Scholar
Banks, J, Ledyard, J, Porter, D (1989) Allocating uncertain and unresponsive resources: An experimental approach. RAND Journal of Economics 20:1–25 CrossRefGoogle Scholar
Banks, J, Olson, M, Porter, D, Rassenti, S, Smith, V (2003) Theory, experiment and the FCC spectrum auctions. Journal of Economic Behavior and Organization 51:303–350 CrossRefGoogle Scholar
Bichler, M, Shabalin, P, Pikovsky, A (2009) A computational analysis of linear-price iterative combinatorial auctions. Information Systems Research 20(1):33–59 CrossRefGoogle Scholar
Bikhchandani, S, Ostroy, JM (2002) The package assignment model. Journal of Economic Theory 107(2):377–406 CrossRefGoogle Scholar
Brunner, C, Goeree, JK, Hold, C, Ledyard, J (2009) An experimental test of flexible combinatorial spectrum auction formats. American Economic Journal: Micro-Economics forthcoming
Chen, Y, Takeuchi, K (2009) Multi-object auctions with package bidding: An experimental comparison of Vickrey and ibea. Games and Economic Behavior, DOI 10.1016/j.geb.2009.10.007
Cramton, P (2009) Auctioning the Digital Dividend, Karlsruhe Institute of Technology
Cramton, P (2013) Spectrum auction design. Review of Industrial Organization 42(2):161–190 CrossRefGoogle Scholar
Cramton, P, Shoham, Y, Steinberg, R (eds) (2006a) Combinatorial Auctions. MIT Press, Cambridge, MA
Cramton, P, Shoham, Y, Steinberg, R (2006b) Introduction to combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial Auctions, MIT Press, Cambridge, MA
Day, R, Raghavan, S (2007) Fair payments for efficient allocations in public sector combinatorial auctions. Management Science 53:1389–1406 CrossRefGoogle Scholar
FCC (2007) Auction of 700 Mhz band licenses scheduled for January 24, 2008. Federal Communications Commition Public Notice (DA 07-4171), URL http://hraunfoss.fcc.gov/edocs_public/ attachmatch/DA-07-4171A1.pdf
Goeree, J, Lien, Y (2016) On the impossibility of core-selecting auctions. Theoretical Economics 11(1)
Goeree, JK, Holt, CA (2010) Hierarchical package bidding: A paper & pencil combinatorial auction. Games and Economic Behavior 70(1): 146–169 CrossRefGoogle Scholar
Hastie, T, Pregibon, D (1992) Generalized linear models. In: Chambers J, Hastie T (eds) Statistical Models in S, Wasworth and Brooks/Cole, Pacific Grove, California
Hollander, M, Wolfe, DA (1973) Nonparametric statistical inference. John Wiley & Sons, New York, USA
Kagel, JH, Lien, Y, Milgrom, P (2009) Ascending prices and package bids: An experimental analysis. In: AEA Conference
Kelso, AS, Crawford, VP (1982) Jobmatching, coalition formation, and gross substitute. Econometrica 50:1483–1504 CrossRefGoogle Scholar
Kwasnica, T, Ledyard, JO, Porter, D, DeMartini, C (2005) A new and improved design for multiobjective iterative auctions. Management Science 51(3):419–434 CrossRefGoogle Scholar
Lamy, L (2009) Core-selecting package auctions: A comment on revenue-monotonicity. International Journal of Game Theory 37 Google Scholar
Ledyard, J, Porter, D, Rangel, A (1997) Experiments testing multiobject allocationmechanisms. Journal of Economics, Management, and Strategy 6:639–675 CrossRefGoogle Scholar
Meeus, L, Verhaegen, K, Belmans, R (2009) Block order restrictions in combinatorial electric energy auctions. European Journal of Operational Research 196:1202–1206 CrossRefGoogle Scholar
Milgrom, P (2000) Putting auction theory to work: The simultaneous ascending auction. Journal of Political Economy 108(21):245–272 CrossRefGoogle Scholar
Miller, GA (1956) The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review 63:81–97 CrossRefGoogle Scholar
Moreton, PS, Spiller, PT (1998) What's in the air: Interlicense synergies in the Federal Communications Commission's broadband personal communication service spectrum auctions. Journal of Law and Economics 41(2):677–716 CrossRefGoogle Scholar
Porter, D, Smith, V (2006) FCC license auction design: A 12-year experiment. Journal of Law Economics and Policy 3
Porter, D, Rassenti, S, Roopnarine, A, Smith, V (2003) Combinatorial auction design. Proceedings of the National Academy of Sciences of the United States of America (PNAS) 100:11,153–11,157 CrossRefGoogle Scholar
Rassenti, S, Smith, VL, Bulfin, RL (1982) A combinatorial auction mechanism for airport time slot allocations. Bell Journal of Economics 13:402–417 CrossRefGoogle Scholar
Rothkopf, MH, Pekec, A, Harstad, RM (1998) Computationally manageable combinatorial auctions. Management Science 44:1131–1147 CrossRefGoogle Scholar
Scheffel, T, Pikovsky, A, Bichler, M, Guler, K (2010) An experimental comparison of linear and nonlinear price combinatorial auctions. Information Systems Research 22(2):346–368 Google Scholar
Schneider, S, Shabalin, P, Bichler, M (2010) On the robustness of non-linear personalized price combinatorial auctions. European Journal of Operational Research 206(1):248–259 CrossRefGoogle 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
×