IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this paper

Optimal Allocation Mechanisms When Bidders Ranking for the objects is common

Listed author(s):
  • Juan Feng
Registered author(s):

    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

    If 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.

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

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

    as
    in new window

    Length:
    Date of creation: 11 Aug 2004
    Handle: RePEc:ecm:nasm04:545
    Contact details of provider: Phone: 1 212 998 3820
    Fax: 1 212 995 4487
    Web page: http://www.econometricsociety.org/pastmeetings.asp
    Email:


    More information through EDIRC

    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.:

    as
    in new window

    1. Alvin E. Roth & Axel Ockenfels, "undated". "Last-Minute Bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet," Papers on Strategic Interaction 2002-32, Max Planck Institute of Economics, Strategic Interaction Group.
    2. Philippe Jehiel & Benny Moldovanu, 1998. "Efficient Design with Interdependent Valuations," Discussion Papers 1244, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Mark Armstrong, 2000. "Optimal Multi-Object Auctions," Review of Economic Studies, Oxford University Press, vol. 67(3), pages 455-481.
    4. Flavio Menezes & Paulo Klinger Monteiro, 1996. "Simultaneous Pooled Auctions," Microeconomics 9611001, EconWPA.
    5. Roth, Alvin E. & Sotomayor, Marilda, 1992. "Two-sided matching," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541 Elsevier.
    6. P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
    7. Paul Resnick & Christopher Avery & Richard Zeckhauser, 1999. "The Market for Evaluations," American Economic Review, American Economic Association, vol. 89(3), pages 564-584, June.
    8. 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.
    9. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    10. 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-438, March.
    11. Christopher Avery & Terrence Hendershott, 2000. "Bundling and Optimal Auctions of Multiple Products," Review of Economic Studies, Oxford University Press, vol. 67(3), pages 483-497.
    12. Palfrey, Thomas R, 1983. "Bundling Decisions by a Multiproduct Monopolist with Incomplete Information," Econometrica, Econometric Society, vol. 51(2), pages 463-483, March.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:ecm:nasm04:545. 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: (Christopher F. Baum)

    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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.