Simplified Mechanisms with Applications to Sponsored Search and Package Auctions
A 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.
|Date of creation:||Oct 2007|
|Contact details of provider:|| Postal: 366 Galvez Street, Stanford, California 94305-6015|
Phone: (650) 725-1874
Fax: (650) 723-8611
Web page: http://siepr.stanford.edu
More information through EDIRC
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.:
- Simon, Leo K & Zame, William R, 1990.
"Discontinuous Games and Endogenous Sharing Rules,"
Econometric Society, vol. 58(4), pages 861-872, July.
- Leo K. Simon and William R. Zame., 1987. "Discontinuous Games and Endogenous Sharing Rules," Economics Working Papers 8756, University of California at Berkeley.
- 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.
- 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.
- 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.
- 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.
- B. Douglas Bernheim & Michael D. Whinston, 1986. "Menu Auctions, Resource Allocation, and Economic Influence," The Quarterly Journal of Economics, Oxford University Press, vol. 101(1), pages 1-31.
- 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.
- Lawrence M. Ausubel & Paul Milgrom, 2002. "Ascending Auctions with Package Bidding," Working Papers 02004, Stanford University, Department of Economics.
- 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.
- 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 Books, Cambridge University Press, number 9780521536721, September.
- Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521551847, September.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Estelle Cantillon & Martin Pesendorfer, 2006. "Auctioning bus routes: the London experience," ULB Institutional Repository 2013/9003, ULB -- Universite Libre de Bruxelles. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:sip:dpaper:07-008. See general information about how to correct material in RePEc.
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.