IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v92y2025i5p2923-2951..html

Robustly Optimal Mechanisms for Selling Multiple Goods

Author

Listed:
  • Yeon-Koo Che
  • Weijie Zhong

Abstract

We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer’s valuations within a set of distributions, called an “ambiguity” set. We identify the exact forms of robustly optimal selling mechanisms and the worst-case distributions when the ambiguity set satisfies various moment conditions on the values of subsets of goods. The analysis reveals general properties of the ambiguity set that justifies categorical bundling, which includes separate sales and pure bundling as special cases.

Suggested Citation

  • Yeon-Koo Che & Weijie Zhong, 2025. "Robustly Optimal Mechanisms for Selling Multiple Goods," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 92(5), pages 2923-2951.
  • Handle: RePEc:oup:restud:v:92:y:2025:i:5:p:2923-2951.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/restud/rdae107
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    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:oup:restud:v:92:y:2025:i:5:p:2923-2951.. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.