IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v52y2023i2d10.1007_s00182-022-00829-w.html
   My bibliography  Save this article

Buyers’ welfare maximizing auction design

Author

Listed:
  • Sebastián D. Bauer

    (Stanford University Graduate School of Business)

Abstract

I derive the incentive compatible and individually rational mechanism that maximizes the sum of the buyers’ ex-ante expected utilities. I also show that this mechanism minimizes the seller’s revenue. When payments are required to be non-negative, my mechanism takes the form of an arbitrarily weighted lottery with no participation fees, and the resulting allocation is generally not ex-post efficient. This means that before learning their valuations and if side payments from the seller to the buyers are not allowed, buyers as a group would be better off if they gave up ex-post efficiency in order to avoid positive payments. When transfers are allowed, the optimal mechanism is a standard auction with no reserve price and where the seller’s income is redistributed back to the buyers. This mechanism is robust to speculators if a buyer with value 0 never partakes in the redistribution.

Suggested Citation

  • Sebastián D. Bauer, 2023. "Buyers’ welfare maximizing auction design," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 555-567, June.
  • Handle: RePEc:spr:jogath:v:52:y:2023:i:2:d:10.1007_s00182-022-00829-w
    DOI: 10.1007/s00182-022-00829-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-022-00829-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00182-022-00829-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nozomu Muto & Yasuhiro Shirata & Takuro Yamashita, 2020. "Revenue-Capped Efficient Auctions," Journal of the European Economic Association, European Economic Association, vol. 18(3), pages 1284-1320.
    2. Susan Athey & Kyle Bagwell & Chris Sanchirico, 2004. "Collusion and Price Rigidity," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 71(2), pages 317-349.
    3. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    4. Bulow, Jeremy & Klemperer, Paul, 1996. "Auctions versus Negotiations," American Economic Review, American Economic Association, vol. 86(1), pages 180-194, March.
    5. James W. Roberts & Andrew Sweeting, 2013. "When Should Sellers Use Auctions?," American Economic Review, American Economic Association, vol. 103(5), pages 1830-1861, August.
    6. Bulow, Jeremy & Roberts, John, 1989. "The Simple Economics of Optimal Auctions," Journal of Political Economy, University of Chicago Press, vol. 97(5), pages 1060-1090, October.
    7. David O. Scrogin & Robert P. Berrens, 2003. "Rationed Access and Welfare: The Case of Public Resource Lotteries," Land Economics, University of Wisconsin Press, vol. 79(2), pages 137-148.
    8. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    9. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    10. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-75, 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. 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. Sweeting, Andrew & Bhattacharya, Vivek, 2015. "Selective entry and auction design," International Journal of Industrial Organization, Elsevier, vol. 43(C), pages 189-207.
    3. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    4. Jing Chen & Silvio Micali, 2016. "Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions," Games, MDPI, vol. 7(4), pages 1-19, October.
    5. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    6. 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.
    7. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    8. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    9. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    10. Sven-Olof Fridolfsson and Thomas P. Tangeras, 2015. "Nuclear Capacity Auctions," The Energy Journal, International Association for Energy Economics, vol. 0(Number 3).
    11. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    12. 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.
    13. Dirk Engelmann & Veronika Grimm, 2009. "Bidding Behaviour in Multi-Unit Auctions - An Experimental Investigation," Economic Journal, Royal Economic Society, vol. 119(537), pages 855-882, April.
    14. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    15. Li, Yunan, 2017. "Approximation in mechanism design with interdependent values," Games and Economic Behavior, Elsevier, vol. 103(C), pages 225-253.
    16. Hitoshi Matsushima & Shunya Noda, 2016. "Mechanism Design in Hidden Action and Hidden Information: Richness and Pure Groves," CARF F-Series CARF-F-386, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    17. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    18. Eric Maskin, 2004. "The Unity of Auction Theory: Paul Milgrom's Masterclass," Economics Working Papers 0044, Institute for Advanced Study, School of Social Science.
    19. Jeremy Bulow & Paul Klemperer, 2007. "When are Auctions Best?," Economics Papers 2007-W03, Economics Group, Nuffield College, University of Oxford.
    20. Philippe Jehiel & Laurent Lamy, 2020. "On the Benefits of Set-Asides," Journal of the European Economic Association, European Economic Association, vol. 18(4), pages 1655-1696.

    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:spr:jogath:v:52:y:2023:i:2:d:10.1007_s00182-022-00829-w. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.