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 UCLA Department of Economics in its series Levine's Bibliography with number 122247000000001454.
Date of creation: 03 Sep 2007
Date of revision:
Contact details of provider:
Web page: http://www.dklevine.com/
Other versions of this item:
- Paul Milgrom, 2007. "Simplified Mechanisms with Applications to Sponsored Search and Package Auctions," Discussion Papers 07-008, Stanford Institute for Economic Policy Research.
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
This paper has been announced in the following NEP Reports:
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.:
- Lawrence M. Ausubel & Peter Crampton & Paul Milgrom, 2004.
"The Clock-Proxy Auction: A Practical Combinatorial Auction Design,"
03-034, Stanford Institute for Economic Policy Research.
- 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.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521551847, November.
- Lawrence M. Ausubel & Paul Milgrom, 2002.
"Ascending Auctions with Package Bidding,"
02004, Stanford University, Department of Economics.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Leo K. Simon and William R. Zame., 1987.
"Discontinuous Games and Endogenous Sharing Rules,"
Economics Working Papers
8756, University of California at Berkeley.
- 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.
- 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.
- 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.
- Estelle Cantillon & Martin Pesendorfer, 2006. "Auctioning bus routes: the London experience," ULB Institutional Repository 2013/9003, ULB -- Universite Libre de Bruxelles.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.