IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2002.09014.html
   My bibliography  Save this paper

Heavy Tails Make Happy Buyers

Author

Listed:
  • Eric Bax

Abstract

In a second-price auction with i.i.d. (independent identically distributed) bidder valuations, adding bidders increases expected buyer surplus if the distribution of valuations has a sufficiently heavy right tail. While this does not imply that a bidder in an auction should prefer for more bidders to join the auction, it does imply that a bidder should prefer it in exchange for the bidder being allowed to participate in more auctions. Also, for a heavy-tailed valuation distribution, marginal expected seller revenue per added bidder remains strong even when there are already many bidders.

Suggested Citation

  • Eric Bax, 2020. "Heavy Tails Make Happy Buyers," Papers 2002.09014, arXiv.org.
    • Handle: RePEc:arx:papers:2002.09014
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2002.09014
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, November.
    2. 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.
    3. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    4. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    5. Hal R. Varian, 2009. "Online Ad Auctions," American Economic Review, American Economic Association, vol. 99(2), pages 430-434, May.
    6. Stourm, Valeria & Bax, Eric, 2017. "Incorporating hidden costs of annoying ads in display auctions," International Journal of Research in Marketing, Elsevier, vol. 34(3), pages 622-640.
    7. Paul Burrows, 1979. "Pigovian Taxes, Polluter Subsidies, Regulation, and the Size of a Polluting Industry," Canadian Journal of Economics, Canadian Economics Association, vol. 12(3), pages 494-501, August.
    8. Eskeland, Gunnar S & Jimenez, Emmanuel, 1992. "Policy Instruments for Pollution Control in Developing Countries," The World Bank Research Observer, World Bank, vol. 7(2), pages 145-169, July.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    10. Seal, Hilary L., 1980. "Survival Probabilities Based on Pareto Claim Distributions," ASTIN Bulletin, Cambridge University Press, vol. 11(1), pages 61-71, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    3. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
    4. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    5. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    6. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    7. Hemant K. Bhargava & Gergely Csapó & Rudolf Müller, 2020. "On Optimal Auctions for Mixing Exclusive and Shared Matching in Platforms," Management Science, INFORMS, vol. 66(6), pages 2653-2676, June.
    8. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.
    9. Hummel, Patrick, 2016. "Position auctions with dynamic resizing," International Journal of Industrial Organization, Elsevier, vol. 45(C), pages 38-46.
    10. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    11. Ragavendran Gopalakrishnan & Eric Bax & Krishna Prasad Chitrapura & Sachin Garg, 2015. "Portfolio Allocation for Sellers in Online Advertising," Papers 1506.02020, arXiv.org.
    12. Krishnamurthy Iyer & Ramesh Johari & Mukund Sundararajan, 2014. "Mean Field Equilibria of Dynamic Auctions with Learning," Management Science, INFORMS, vol. 60(12), pages 2949-2970, December.
    13. James Li & Eric Bax & Nilanjan Roy & Andrea Leistra, 2015. "VCG Payments for Portfolio Allocations in Online Advertising," Papers 1506.02013, arXiv.org.
    14. Jian Pei, 2020. "A Survey on Data Pricing: from Economics to Data Science," Papers 2009.04462, arXiv.org, revised Nov 2020.
    15. Bax, Eric & Kuratti, Anand & Mcafee, Preston & Romero, Julian, 2012. "Comparing predicted prices in auctions for online advertising," International Journal of Industrial Organization, Elsevier, vol. 30(1), pages 80-88.
    16. Ming Chen & Sareh Nabi & Marciano Siniscalchi, 2023. "Advancing Ad Auction Realism: Practical Insights & Modeling Implications," Papers 2307.11732, arXiv.org, revised Apr 2024.
    17. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    18. Hu, Audrey & Offerman, Theo & Zou, Liang, 2011. "Premium auctions and risk preferences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2420-2439.
    19. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    20. Jesse A. Schwartz & Quan Wen, 2008. "A Revelation Principle for Dominant Strategy Implementation," Vanderbilt University Department of Economics Working Papers 0819, Vanderbilt University Department of Economics.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2002.09014. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.