Simplified Mechanisms with Applications to Sponsored Search and Package Auctions
AbstractA simplified mechanism is a direct mechanism modified by restricting the set of reports or bids. An example is the auction used to place ads on Internet search pages, in which each advertiser bids a single price to determine the allocation of eight or more ad positions on a page. If a simplified mechanism satisfies the “best-reply-closure” property, then all Nash equilibria of the simplified mechanism are also equilibria of the original direct mechanism. For search advertising auctions, suitable simplifications eliminate inefficient, low-revenue equilibria that are favored in the original direct mechanism when bidding costs are positive.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Stanford Institute for Economic Policy Research in its series Discussion Papers with number 07-008.
Date of creation: Oct 2007
Date of revision:
simplified mechanisms; sponsored search; generalized second price auctions; package auctions; combinatorial auctions; core-selecting auctions; mechanism design;
Other versions of this item:
- Paul Milgrom, 2007. "Simplified Mechanisms with Applications to Sponsored Search and Package Auctions," Levine's Bibliography 122247000000001454, UCLA Department of Economics.
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
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.:
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005.
"Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords,"
NBER Working Papers
11765, National Bureau of Economic Research, Inc.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
- Ausubel Lawrence M & Milgrom Paul R, 2002.
"Ascending Auctions with Package Bidding,"
The B.E. Journal of Theoretical Economics,
De Gruyter, vol. 1(1), pages 1-44, August.
- Estelle Cantillon & Martin Pesendorfer, 2006. "Auctioning bus routes: the London experience," ULB Institutional Repository 2013/9003, ULB -- Universite Libre de Bruxelles.
- Tjalling C. Koopmans & Martin J. Beckmann, 1955. "Assignment Problems and the Location of Economic Activities," Cowles Foundation Discussion Papers 4, Cowles Foundation for Research in Economics, Yale University.
- Bernheim, B Douglas & Whinston, Michael D, 1986. "Menu Auctions, Resource Allocation, and Economic Influence," The Quarterly Journal of Economics, MIT Press, vol. 101(1), pages 1-31, February.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521536721, November.
- Simon, Leo K & Zame, William R, 1990.
"Discontinuous Games and Endogenous Sharing Rules,"
Econometric Society, vol. 58(4), pages 861-72, July.
- Simon, Leo K. & Zame, William R., 1987. "Discontinous Games and Endogenous Sharing Rules," Department of Economics, Working Paper Series qt8n46v2wv, Department of Economics, Institute for Business and Economic Research, UC Berkeley.
- Leo K. Simon and William R. Zame., 1987. "Discontinuous Games and Endogenous Sharing Rules," Economics Working Papers 8756, University of California at Berkeley.
- Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2004.
"The Clock-Proxy Auction: A Practical Combinatorial Auction Design,"
Papers of Peter Cramton
04mit5, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Lawrence M. Ausubel & Peter Crampton & Paul Milgrom, 2004. "The Clock-Proxy Auction: A Practical Combinatorial Auction Design," Discussion Papers 03-034, Stanford Institute for Economic Policy Research.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Anne Shor).
If references are entirely missing, you can add them using this form.