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

Social Surplus Maximization in Sponsored Search Auctions Requires Communication

Author

Listed:
  • Suat Evren

Abstract

We show that computing the optimal social surplus requires $\Omega(mn)$ bits of communication between the website and the bidders in a sponsored search auction with $n$ slots on the website and with tick size of $2^{-m}$ in the discrete model, even when bidders are allowed to freely communicate with each other.

Suggested Citation

  • Suat Evren, 2023. "Social Surplus Maximization in Sponsored Search Auctions Requires Communication," Papers 2305.07729, arXiv.org.
    • Handle: RePEc:arx:papers:2305.07729
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Gonczarowski, Yannai A. & Nisan, Noam & Ostrovsky, Rafail & Rosenbaum, Will, 2019. "A stable marriage requires communication," Games and Economic Behavior, Elsevier, vol. 118(C), pages 626-647.
    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. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
    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. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    2. Naveen Durvasula, 2022. "Utility-Based Communication Requirements for Stable Matching in Large Markets," Papers 2212.04024, arXiv.org.
    3. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2020. "Mechanism Design meets Priority Design: Redesigning the US Army’s Branching Process Through Market Design," Boston College Working Papers in Economics 1035, Boston College Department of Economics.
    4. Kyle Greenberg & Parag A. Pathak & Tayfun Sonmez, 2021. "Mechanism Design meets Priority Design: Redesigning the US Army's Branching Process," Papers 2106.06582, arXiv.org.
    5. Abou Nabout, Nadia & Skiera, Bernd, 2012. "Return on Quality Improvements in Search Engine Marketing," Journal of Interactive Marketing, Elsevier, vol. 26(3), pages 141-154.
    6. Muriel Niederle & Alvin E. Roth, 2009. "The Effects of a Centralized Clearinghouse on Job Placement, Wages, and Hiring Practices," NBER Chapters, in: Studies of Labor Market Intermediation, pages 235-271, National Bureau of Economic Research, Inc.
    7. 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.
    8. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    9. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    10. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    11. Gleb Romanyuk & Alex Smolin, 2019. "Cream Skimming and Information Design in Matching Markets," American Economic Journal: Microeconomics, American Economic Association, vol. 11(2), pages 250-276, May.
    12. Ming Chen & Sareh Nabi & Marciano Siniscalchi, 2023. "Advancing Ad Auction Realism: Practical Insights & Modeling Implications," Papers 2307.11732, arXiv.org, revised Apr 2024.
    13. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    14. Anindya Ghose & Sha Yang, 2007. "An Empirical Analysis of Search Engine Advertising: Sponsored Search and Cross-Selling in Electronic Markets," Working Papers 07-35, NET Institute, revised Sep 2007.
    15. Sami Najafi-Asadolahi & Kristin Fridgeirsdottir, 2014. "Cost-per-Click Pricing for Display Advertising," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 482-497, October.
    16. Mahsa Derakhshan & Negin Golrezaei & Renato Paes Leme, 2022. "Linear Program-Based Approximation for Personalized Reserve Prices," Management Science, INFORMS, vol. 68(3), pages 1849-1864, March.
    17. Parag A. Pathak & Tayfun Sönmez & M. Utku Ünver & M. Bumin Yenmez, 2024. "Fair Allocation of Vaccines, Ventilators and Antiviral Treatments: Leaving No Ethical Value Behind in Healthcare Rationing," Management Science, INFORMS, vol. 70(6), pages 3999-4036, June.
    18. Qingmin Liu & George J. Mailath & Andrew Postlewaite & Larry Samuelson, 2012. "Matching with Incomplete Information," Levine's Working Paper Archive 786969000000000551, David K. Levine.
    19. C.-Philipp Heller & Johannes Johnen & Sebastian Schmitz, 2019. "Congestion Pricing: A Mechanism Design Approach," Journal of Transport Economics and Policy, University of Bath, vol. 53(1), pages 74-7-98.
    20. Alex Jiyoung Kim & Subramanian Balachander, 2023. "Coordinating traditional media advertising and online advertising in brand marketing," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1865-1879, June.

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