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.
(This abstract was borrowed from another version of this item.)
References listed on IDEAS
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.:
- Leo K. Simon and William R. Zame., 1987.
"Discontinuous Games and Endogenous Sharing Rules,"
Economics Working Papers
8756, University of California at Berkeley.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521551847, November.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:cla:levrem:122247000000001454. 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: (David K. Levine)
If references are entirely missing, you can add them using this form.