Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-sxzjt Total loading time: 0 Render date: 2024-04-23T05:40:14.691Z Has data issue: false hasContentIssue false

11 - Core-Selecting Package Auctions

from Part II - The Combinatorial Clock Auction Designs

Published online by Cambridge University Press:  26 October 2017

Robert Day
Affiliation:
School of Business, University of Connecticut
Paul R. Milgrom
Affiliation:
Department of Economics, Stanford University
Martin Bichler
Affiliation:
Technische Universität München
Jacob K. Goeree
Affiliation:
University of New South Wales, Sydney
Get access

Summary

Introduction

Recent years have seen several new and important applications of matching procedures in practical applications, including school assignments in New York and Boston and new designs for life-saving organ exchanges. The mechanisms that have been adopted, and sometimes even the runner-up mechanisms, are stable matching mechanisms. Recall that stable matches are matches with the property that no individual can do better by staying unmatched and no pair can both do better by matching to one another. Since pairs are the only significant coalitions in this theory, stable matches are a kind of core allocation. Stable matching mechanisms are direct mechanisms that select a stable match with respect to the reported preferences; the definition does not require that the mechanism be incentive-compatible.

Evidence suggesting that stable matching mechanisms remain in use long after unstable mechanisms have been abandoned is found both in empirical studies (Roth and Xing 1994) and in laboratory experiments (Kagel and Roth 2000). If stable mechanisms actually lead to stable matches, then these mechanisms have the important practical advantage that no couple that would prefer to renege after the mechanism is run in favor of some alternative pairing, because no such agreement can be better for both members of the couple than the outcome of a stable matching mechanism. Even for a stable mechanism, with enough uncertainty, there might be pairs that could increase their expected payoffs by matching in advance, but the resulting unstable match would be vulnerable to defections by parties who might find a better alternative.

A similar analysis applies to core-selecting auction mechanisms. An individually rational outcome is in the core of an auction game if and only if there is no group of bidders who would strictly prefer an alternative deal that is also strictly better for seller. Consequently, an auction mechanism that delivers core allocations has the advantages that there is no individual or group that would want to renege after the auction is run in favor of some allocation that is feasible for it and any non-core agreement made before the auction is vulnerable to defections, as the seller attracts better offers afterwards.

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

Abdulkadiroglu, A. Pathak, P. Roth, A. Sonmez, T. (2005) The Boston Public School Match. In: AEA papers and proceedings, pp 368–371 CrossRef
Ausubel, L. Milgrom, P. (2002) Ascending auctions with package bidding. Front Theor Econ 1(1), Article 1Google Scholar
Ausubel, L. Milgrom, P. (2005) The lovely but lonely Vickrey auction. In: Cramton, P. Shoham, Y. Steinberg, R. (eds) Combinatorial auctions. MIT Press, Cambridge
Bernheim, BD. Whinston, M. (1986) Menu auctions, resource allocation and economic influence. Q J Econ 101:1–31 CrossRefGoogle Scholar
Bertrand, J. (1883) Théorie Mathématique de la Richesse Sociale. J des Savants 69:499–508 20 Hatfield and Milgrom (2005) introduced the endowed assignment valuations for this purpose. 240 robert day and paul r. milgrom
Day, RW. Raghavan, S. (2006) Fair payments for efficient allocations in public sector combinatorial auctions. Manag Sci (Forthcoming)
Green, J. Laffont, J-J. (1979) Incentives in public decision making. North Holland, Amsterdam
Hatfield, J. Milgrom, P. (2005) Matching with contracts. Am Econ Rev 95(4):913–935CrossRefGoogle Scholar
Holmstrom, B. (1979) Groves schemes on restricted domains. Econometrica 47:1137–1144 CrossRefGoogle Scholar
Kagel, J. Roth, A. (2000) The dynamics of reorganization inmatchingmarkets: a laboratory experiment motivated by a natural experiment. Q J Econ:201–235 CrossRefGoogle Scholar
Kelso, A. Crawford, V. (1982) Job matching, coalition formation, and gross substitutes. Econometrica 50:1483–1504 CrossRefGoogle Scholar
McMillan, J. (1994) Selling spectrum rights. J Econ Perspect 8:145–162 CrossRefGoogle Scholar
Milgrom, P. (2004) Putting auction theory to work. Cambridge University Press, Cambridge
Milgrom, P. (2006) Incentives in core-selecting auctions. Stanford University
Parkes, D. Ungar, L. (2000) Iterative combinatorial auctions: theory and practice. In: Proceedings of the 17th national conference on artificial intelligence, pp 74–81
Reny, P. (1999) On the existence of pure and mixed strategy nash equilibria in discontinuous games. Econometrica 67(5):1029–1056CrossRefGoogle Scholar
Roberts, J. Postlewaite, A. 1976) The incentives for price-taking behavior in large exchange economies. Econometrica 44(1):115–129 Google Scholar
Roth, AE. (1982) The economics of matching: stability and incentives. Math Oper Res 7:617–628 CrossRefGoogle Scholar
Roth, AE. Peranson, E. (1999) The redesign of the matching market for American physicians: some engineering aspects of economic design. Am Econ Rev 89:748–780 CrossRefGoogle Scholar
Roth, AE. Sotomayor, M. 1990) Two-sidedmatching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge
Roth, AE. Xing, X. (1994) Jumping the gun: imperfections and institutions related to the timing of market transactions. Am Econ Rev 84:992–1044 Google Scholar
Segal, I. (2003) The communication requirements of combinatorial auctions. In: Cramton, P. Shoham, Y. Steinberg, R. (eds) Combinatorial Auctions. Princeton University Press, Princeton
Simon, LK. Zame, WR. (1990) Discontinuous games and endogenous sharing rules. Econometrica 58:861–872 CrossRefGoogle Scholar
Yokoo, M. Sakurai, Y. Matsubara, S. (2004) The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. Games Econ Behav 46(1):174–188CrossRefGoogle 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
×