IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v134y2022icp104-116.html
   My bibliography  Save this article

Buy-many mechanisms are not much better than item pricing

Author

Listed:
  • Chawla, Shuchi
  • Teng, Yifeng
  • Tzamos, Christos

Abstract

Multi-item mechanisms can be very complex offering many different randomized bundles to the buyer. Such complexity is thought to be necessary as the revenue gaps between optimal mechanisms and simple mechanisms are unbounded.

Suggested Citation

  • Chawla, Shuchi & Teng, Yifeng & Tzamos, Christos, 2022. "Buy-many mechanisms are not much better than item pricing," Games and Economic Behavior, Elsevier, vol. 134(C), pages 104-116.
    • Handle: RePEc:eee:gamebe:v:134:y:2022:i:c:p:104-116
    DOI: 10.1016/j.geb.2022.04.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825622000690
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2022.04.003?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. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    2. Chawla, Shuchi & Malec, David & Sivan, Balasubramanian, 2015. "The power of randomness in Bayesian optimal mechanism design," Games and Economic Behavior, Elsevier, vol. 91(C), pages 297-317.
    3. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.
    4. Rochet, J. C., 1985. "The taxation principle and multi-time Hamilton-Jacobi equations," Journal of Mathematical Economics, Elsevier, vol. 14(2), pages 113-128, April.
    5. Shuchi Chawla & Jason Hartline & David Malec & Balasubramanian Sivan, 2010. "Sequential Posted Pricing and Multi-parameter Mechanism Design," Discussion Papers 1486, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org, revised Jun 2024.

    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. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    2. Chen, Xi & Diakonikolas, Ilias & Paparas, Dimitris & Sun, Xiaorui & Yannakakis, Mihalis, 2018. "The complexity of optimal multidimensional pricing for a unit-demand buyer," Games and Economic Behavior, Elsevier, vol. 110(C), pages 139-164.
    3. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    4. Moshe Babaioff & Michal Feldman & Yannai A. Gonczarowski & Brendan Lucier & Inbal Talgam-Cohen, 2020. "Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer," Papers 2003.05913, arXiv.org, revised Aug 2020.
    5. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    6. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    7. Tim Roughgarden & Inbal Talgam-Cohen & Qiqi Yan, 2019. "Robust Auctions for Revenue via Enhanced Competition," Operations Research, INFORMS, vol. 68(4), pages 1074-1094, July.
    8. Yuan Deng & Jieming Mao & Balasubramanian Sivan & Kangning Wang, 2021. "Optimal Pricing Schemes for an Impatient Buyer," Papers 2106.02149, arXiv.org, revised Feb 2023.
    9. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    10. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    11. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    12. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    13. Jamie Tucker-Foltz & Richard Zeckhauser, 2022. "Playing Divide-and-Choose Given Uncertain Preferences," Papers 2207.03076, arXiv.org, revised Oct 2024.
    14. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.
    15. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.
    16. Yannai A. Gonczarowski & Nicole Immorlica & Yingkai Li & Brendan Lucier, 2021. "Revenue Maximization for Buyers with Costly Participation," Papers 2103.03980, arXiv.org, revised Nov 2023.
    17. , & , J., 2015. "Maximal revenue with multiple goods: nonmonotonicity and other observations," Theoretical Economics, Econometric Society, vol. 10(3), September.
    18. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org, revised Jun 2024.
    19. Dirk Bergemann & Yang Cai & Grigoris Velegkas & Mingfei Zhao, 2022. "Is Selling Complete Information (Approximately) Optimal?," Cowles Foundation Discussion Papers 2324, Cowles Foundation for Research in Economics, Yale University.
    20. Tomer Siedner, 2019. "Optimal pricing by a risk-averse seller," Discussion Paper Series dp725, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    More about this item

    Keywords

    Revenue maximization; Lotteries; Simple mechanisms; Menu-size complexity;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:eee:gamebe:v:134:y:2022:i:c:p:104-116. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.