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

The complexity of optimal multidimensional pricing for a unit-demand buyer

Author

Listed:
  • Chen, Xi
  • Diakonikolas, Ilias
  • Paparas, Dimitris
  • Sun, Xiaorui
  • Yannakakis, Mihalis

Abstract

We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2, and its decision version is NP-complete for distributions of support size 3. We also show that the problem remains NP-complete for the case of identical distributions.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:gamebe:v:110:y:2018:i:c:p:139-164
    DOI: 10.1016/j.geb.2018.03.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825618300484
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2018.03.016?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. Manelli, Alejandro M. & Vincent, Daniel R., 2007. "Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly," Journal of Economic Theory, Elsevier, vol. 137(1), pages 153-185, November.
    4. Pavlov Gregory, 2011. "A Property of Solutions to Linear Monopoly Problems," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-18, February.
    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.
    6. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.
    7. Thanassoulis, John, 2004. "Haggling over substitutes," Journal of Economic Theory, Elsevier, vol. 117(2), pages 217-245, August.
    8. Sergiu Hart & Noam Nisan, 2013. "The Menu-Size Complexity of Auctions," Discussion Paper Series dp637, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. Zhenzhen Yan & Karthik Natarajan & Chung Piaw Teo & Cong Cheng, 2022. "A Representative Consumer Model in Data-Driven Multiproduct Pricing Optimization," Management Science, INFORMS, vol. 68(8), pages 5798-5827, August.
    2. 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.
    3. Adam N. Elmachtoub & Michael L. Hamilton, 2021. "The Power of Opaque Products in Pricing," Management Science, INFORMS, vol. 67(8), pages 4686-4702, August.

    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. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    2. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.
    3. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    4. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    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. 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.
    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. Azar, Pablo D. & Kleinberg, Robert & Weinberg, S. Matthew, 2019. "Prior independent mechanisms via prophet inequalities with limited information," Games and Economic Behavior, Elsevier, vol. 118(C), pages 511-532.
    9. Gagan Aggarwal & Kshipra Bhawalkar & Guru Guruganesh & Andres Perlroth, 2021. "Maximizing revenue in the presence of intermediaries," Papers 2111.10472, arXiv.org.
    10. 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).
    11. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    12. Sergiu Hart & Noam Nisan, 2013. "Selling Multiple Correlated Goods: Revenue Maximization and Menu-Size Complexity (old title: "The Menu-Size Complexity of Auctions")," Papers 1304.6116, arXiv.org, revised Nov 2018.
    13. 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.
    14. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.
    15. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2022.
    16. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org.
    17. 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.
    18. Constantinos Daskalakis & Maxwell Fishelson & Brendan Lucier & Vasilis Syrgkanis & Santhoshini Velusamy, 2020. "Multi-item Non-truthful Auctions Achieve Good Revenue," Papers 2002.06702, arXiv.org, revised Sep 2022.
    19. Devanur, Nikhil R. & Haghpanah, Nima & Psomas, Alexandros, 2020. "Optimal multi-unit mechanisms with private demands," Games and Economic Behavior, Elsevier, vol. 121(C), pages 482-505.
    20. Debasis Mishra & Kolagani Paramahamsa, 2018. "Selling to a naive agent with two rationales," Discussion Papers 18-03, Indian Statistical Institute, Delhi.

    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:110:y:2018:i:c:p:139-164. 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.