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

Beckmann's approach to multi-item multi-bidder auctions

Author

Listed:
  • Alexander V. Kolesnikov
  • Fedor Sandomirskiy
  • Aleh Tsyvinski
  • Alexander P. Zimin

Abstract

We consider the problem of revenue-maximizing Bayesian auction design with several bidders having independent private values over several items. We show that it can be reduced to the problem of continuous optimal transportation introduced by Beckmann (1952) where the optimal transportation flow generalizes the concept of ironed virtual valuations to the multi-item setting. We establish the strong duality between the two problems and the existence of solutions. The results rely on insights from majorization and optimal transportation theories and on the characterization of feasible interim mechanisms by Hart and Reny (2015).

Suggested Citation

  • Alexander V. Kolesnikov & Fedor Sandomirskiy & Aleh Tsyvinski & Alexander P. Zimin, 2022. "Beckmann's approach to multi-item multi-bidder auctions," Papers 2203.06837, arXiv.org, revised Sep 2022.
    • Handle: RePEc:arx:papers:2203.06837
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Sergiu Hart & Philip J. Reny, 2015. "Implementation of reduced form mechanisms: a simple approach and a new characterization," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 3(1), pages 1-8, April.
    2. Constantinos Daskalakis & Alan Deckelbaum & Christos Tzamos, 2017. "Strong Duality for a Multiple‐Good Monopolist," Econometrica, Econometric Society, vol. 85, pages 735-767, May.
    3. Alfred Galichon, 2016. "Optimal Transport Methods in Economics," Economics Books, Princeton University Press, edition 1, number 10870.
    4. Stefan Steinerberger & Aleh Tsyvinski, 2019. "Tax Mechanisms and Gradient Flows," Papers 1904.13276, arXiv.org.
    5. Nima Haghpanah & Jason Hartline, 2021. "When Is Pure Bundling Optimal? [Commodity Bundling and the Burden of Monopoly]," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 88(3), pages 1127-1156.
    6. Çağıl Koçyiğit & Garud Iyengar & Daniel Kuhn & Wolfram Wiesemann, 2020. "Distributionally Robust Mechanism Design," Management Science, INFORMS, vol. 66(1), pages 159-189, January.
    7. Job Boerma & Aleh Tsyvinski & Alexander P. Zimin, 2021. "Sorting with Teams," Papers 2109.02730, arXiv.org, revised Nov 2023.
    8. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2016. "Informationally Robust Optimal Auction Design," Working Papers 084_2016, Princeton University, Department of Economics, Econometric Research Program..
    9. Figalli, Alessio & Kim, Young-Heon & McCann, Robert J., 2011. "When is multidimensional screening a convex program?," Journal of Economic Theory, Elsevier, vol. 146(2), pages 454-478, March.
    10. Piotr Dworczak & Giorgio Martini, 2019. "The Simple Economics of Optimal Persuasion," Journal of Political Economy, University of Chicago Press, vol. 127(5), pages 1993-2048.
    11. Alex Gershkov & Benny Moldovanu & Philipp Strack & Mengxi Zhang, 2021. "A Theory of Auctions with Endogenous Valuations," Journal of Political Economy, University of Chicago Press, vol. 129(4), pages 1011-1051.
    12. Alex Suzdaltsev, 2020. "An Optimal Distributionally Robust Auction," Papers 2006.05192, arXiv.org, revised Aug 2020.
    13. Treb Allen & Costas Arkolakis, 2014. "Trade and the Topography of the Spatial Economy," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 129(3), pages 1085-1140.
    14. Pierre-André Chiappori & Robert McCann & Lars Nesheim, 2010. "Hedonic price equilibria, stable matching, and optimal transport: equivalence, topology, and uniqueness," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(2), pages 317-354, February.
    15. Georg Nöldeke & Larry Samuelson, 2018. "The Implementation Duality," Econometrica, Econometric Society, vol. 86(4), pages 1283-1324, July.
    16. Andreas Kleiner & Benny Moldovanu & Philipp Strack, 2021. "Extreme Points and Majorization: Economic Applications," Econometrica, Econometric Society, vol. 89(4), pages 1557-1593, July.
    17. Manelli, Alejandro M. & Vincent, Daniel R., 2006. "Bundling as an optimal selling mechanism for a multiple-good monopolist," Journal of Economic Theory, Elsevier, vol. 127(1), pages 1-35, March.
    18. Dizdar, Deniz & Kováč, Eugen, 2020. "A simple proof of strong duality in the linear persuasion problem," Games and Economic Behavior, Elsevier, vol. 122(C), pages 407-412.
    19. Alfred Galichon, 2016. "Optimal transport methods in economics," Post-Print hal-03256830, HAL.
    20. Alfred Galichon, 2021. "A survey of some recent applications of optimal transport methods to econometrics," Papers 2102.01716, arXiv.org.
    21. Andreas Kleiner & Alejandro Manelli, 2019. "Strong Duality in Monopoly Pricing," Econometrica, Econometric Society, vol. 87(4), pages 1391-1396, July.
    22. Guo, Yingni & Shmaya, Eran, 2021. "Costly miscalibration," Theoretical Economics, Econometric Society, vol. 16(2), May.
    23. Fabien Gensbittel, 2015. "Extensions of the Cav( u ) Theorem for Repeated Games with Incomplete Information on One Side," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 80-104, February.
    24. Job Boerma & Aleh Tsyvinski & Alexander P. Zimin, 2021. "Sorting with Team Formation," NBER Working Papers 29290, National Bureau of Economic Research, Inc.
    25. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    26. Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, June.
    27. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    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. Itai Arieli & Yakov Babichenko & Fedor Sandomirskiy, 2023. "Feasible Conditional Belief Distributions," Papers 2307.07672, arXiv.org, revised Nov 2024.
    2. Ruodu Wang & Zhenyuan Zhang, 2022. "Simultaneous Optimal Transport," Papers 2201.03483, arXiv.org, revised Dec 2024.
    3. Andreas Kleiner & Benny Moldovanu & Philipp Strack, 2021. "Extreme Points and Majorization: Economic Applications," Econometrica, Econometric Society, vol. 89(4), pages 1557-1593, July.
    4. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    5. Robert J. McCann & Kelvin Shuangjian Zhang, 2023. "A duality and free boundary approach to adverse selection," Papers 2301.07660, arXiv.org, revised Nov 2023.
    6. Michael Greinecker & Christopher Kah, 2021. "Pairwise Stable Matching in Large Economies," Econometrica, Econometric Society, vol. 89(6), pages 2929-2974, November.
    7. Ethan Che, 2019. "Distributionally Robust Optimal Auction Design under Mean Constraints," Papers 1911.07103, arXiv.org, revised Feb 2022.
    8. Mario Ghossoub & David Saunders, 2020. "On the Continuity of the Feasible Set Mapping in Optimal Transport," Papers 2009.12838, arXiv.org.
    9. Michael J. Curry & Zhou Fan & David C. Parkes, 2024. "Optimal Automated Market Makers: Differentiable Economics and Strong Duality," Papers 2402.09129, arXiv.org.
    10. Florian Gunsilius, 2018. "Point-identification in multivariate nonseparable triangular models," Papers 1806.09680, arXiv.org.
    11. Xu Lang, 2022. "Reduced-form budget allocation with multiple public alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 335-359, August.
    12. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    13. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    14. Andreas Kleiner, 2022. "Optimal Delegation in a Multidimensional World," Papers 2208.11835, arXiv.org.
    15. Frank Yang, 2021. "Costly Multidimensional Screening," Papers 2109.00487, arXiv.org, revised Aug 2022.
    16. Takaaki Koike & Liyuan Lin & Ruodu Wang, 2022. "Joint mixability and notions of negative dependence," Papers 2204.11438, arXiv.org, revised Jan 2024.
    17. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian & Saša Pekeč, 2022. "Revenue-Sharing Allocation Strategies for Two-Sided Media Platforms: Pro-Rata vs. User-Centric," Management Science, INFORMS, vol. 68(12), pages 8699-8721, December.
    18. Pablo D. Fajgelbaum & Edouard Schaal, 2020. "Optimal Transport Networks in Spatial Equilibrium," Econometrica, Econometric Society, vol. 88(4), pages 1411-1452, July.
    19. Brendan Pass, 2017. "Interpolating between matching and hedonic pricing models," Papers 1701.04431, arXiv.org.
    20. Arthur Charpentier & Alfred Galichon & Lucas Vernet, 2019. "Optimal transport on large networks a practitioner guide," Working Papers hal-02173210, HAL.

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