This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Optimal Allocation Mechanisms When Bidders Ranking for the objects is common

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Juan Feng
Abstract

Search engines commonly use “sponsored linksâ€, where certain advertisers’ links are promoted to be placed above others in return for monetary payment. It is natural to assume that all providers value a higher ranked placement more than lower ranked ones. Then how should the seller optimally sell these ranked slots is critical for the search engines. In this paper we study the seller’s (search engine) optimal selling mechanism in the following setting: buyers (advertisers), each of whom has unit demand, compete for positions o ered by the seller. While each buyer’s valuation for each position is private and independent, the ranking for these positions is common among all the buyers. However the rate at which these valuations change might be di erent. We begin with 4 simplified scenarios specifying how buyers valuations change for di erent positions, namely,“parallelâ€, “convergentâ€, “divergentâ€, and “convergent then divergentâ€. We find that the optimal incentive compatible allocation mechanism is quite di erent in determining the “pivot†types and the order to fill in the positions. Under some conditions, these mechanisms are even ecient in terms of maximizing the total welfare of the auctioneer and bidders. When the buyers’ valuations for lower positions decrease at di erent rates, the seller earns more than the case of simple second-price sequential auction

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://repec.org/esNASM04/up.27227.1075586911.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Econometric Society in its series Econometric Society 2004 North American Summer Meetings with number 545.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 11 Aug 2004
Date of revision:
Handle: RePEc:ecm:nasm04:545

Contact details of provider:
Phone: 1 212 998 3820
Fax: 1 212 995 4487
Email:
Web page: http://www.econometricsociety.org/pastmeetings.asp
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords: optimal auction; mechanism design; heterogeneous objects; ranking;

Find related papers by JEL classification:
D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information

This paper has been announced in the following NEP Reports:

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.:
  1. Menezes, Flavio M & Monteiro, Paulo Klinger, 1998. "Simultaneous Pooled Auctions," The Journal of Real Estate Finance and Economics, Springer, vol. 17(3), pages 219-32, November. [Downloadable!] (restricted)
    Other versions:
  2. Armstrong, Mark, 2000. "Optimal Multi-object Auctions," Review of Economic Studies, Blackwell Publishing, vol. 67(3), pages 455-81, July.
  3. Palfrey, Thomas R, 1983. "Bundling Decisions by a Multiproduct Monopolist with Incomplete Information," Econometrica, Econometric Society, vol. 51(2), pages 463-83, March. [Downloadable!] (restricted)
  4. Avery, Christopher & Hendershott, Terrence, 2000. "Bundling and Optimal Auctions of Multiple Products," Review of Economic Studies, Blackwell Publishing, vol. 67(3), pages 483-97, July.
  5. Christopher Avery & Paul Resnick & Richard Zeckhauser, 1999. "The Market for Evaluations," American Economic Review, American Economic Association, vol. 89(3), pages 564-584, June. [Downloadable!] (restricted)
  6. Partha Dasgupta & Eric Maskin, 2000. "Efficient Auctions," The Quarterly Journal of Economics, MIT Press, vol. 115(2), pages 341-388, May. [Downloadable!] (restricted)
    Other versions:
  7. Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-38, March. [Downloadable!] (restricted)
  8. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July. [Downloadable!] (restricted)
  9. Alvin E. Roth & Axel Ockenfels, 2002. "Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet," American Economic Review, American Economic Association, vol. 92(4), pages 1093-1103, September. [Downloadable!]
    Other versions:
  10. Lawrence M. Ausubel & Peter Cramton, 1995. "Demand Reduction and Inefficiency in Multi-Unit Auctions," Papers of Peter Cramton 98wpdr, University of Maryland, Department of Economics - Peter Cramton, revised 22 Jul 2002. [Downloadable!]
  11. Michael R. Baye & John Morgan, 2004. "Price Dispersion in the Lab and on the Internet: Theory and Evidence," RAND Journal of Economics, The RAND Corporation, vol. 35(3), pages 448-466, Autumn.
    Other versions:
  12. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-59, September.
    Other versions:
Full references

Statistics
Access and download statistics

Did you know? A few items listed on IDEAS are over 2000 years old!

This page was last updated on 2009-12-2.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.