IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/2324.html
   My bibliography  Save this paper

Is Selling Complete Information (Approximately) Optimal?

Author

Listed:

Abstract

We study the problem of selling information to a data-buyer who faces a decision problem under uncertainty. We consider the classic Bayesian decision-theoretic model pioneered by Blackwell [Bla51, Bla53]. Initially, he data buyer has only partial information about the payoff-relevant state of the world. A data seller offers additional information about the state of the world. The information is revealed through signaling schemes, also referred to as experiments. In the single-agent setting, any mechanism can be represented as a menu of experiments. A recent paper by Bergemann et al.[BBS18] present a complete characterization of the revenue-optimal mechanism in a binary state and binary action environment. By contrast, no characterization is known for the case with more actions. In this paper, we consider more general environments and study arguably the simplest mechanism, which only sells the fully informative experiment. In the environment with binary state and m = 3 actions, we provide an O(m)-approximation to the optimal revenue by selling only the fully informative experiment and show that the approximation ratio is tight up to an absolute constant factor. An important corollary of our lower bound is that the size of the optimal menu must grow at least linearly in the number of available actions, so no universal upper bound exists for the size of the optimal menu in the general single-dimensional setting. We also provide a sufficient condition under which selling only the fully informative experiment achieves the optimal revenue. For multi-dimensional environments, we prove that even in arguably the simplest matching utility environment with 3 states and 3 actions, the ratio between the optimal revenue and the revenue by selling only the fully informative experiment can grow immediately to a polynomial of the number of agent types. Nonetheless, if the distribution is uniform, we show that selling only the fully informative experiment is indeed the optimal mechanism.

Suggested Citation

  • 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.
  • Handle: RePEc:cwl:cwldpp:2324
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d23/d2324.pdf
    Download Restriction: no
    ---><---

    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. Dirk Bergemann & Alessandro Bonatti, 2015. "Selling Cookies," American Economic Journal: Microeconomics, American Economic Association, vol. 7(3), pages 259-294, August.
    3. Ely, Jeffrey & Galeotti, Andrea & Jann, Ole & Steiner, Jakub, 2021. "Optimal test allocation," Journal of Economic Theory, Elsevier, vol. 193(C).
    4. Toikka, Juuso, 2011. "Ironing without control," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2510-2526.
    5. Yingkai Li, 2021. "Selling Data to an Agent with Endogenous Information," Papers 2103.05788, arXiv.org, revised Aug 2023.
    6. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    7. Constantinos Daskalakis & Alan Deckelbaum & Christos Tzamos, 2017. "Strong Duality for a Multiple‐Good Monopolist," Econometrica, Econometric Society, vol. 85, pages 735-767, May.
    8. 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.
    9. John Riley & Richard Zeckhauser, 1983. "Optimal Selling Strategies: When to Haggle, When to Hold Firm," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 98(2), pages 267-289.
    10. Anna, Petrenko, 2016. "Мaркування готової продукції як складова частина інформаційного забезпечення маркетингової діяльності підприємств овочепродуктового підкомплексу," Agricultural and Resource Economics: International Scientific E-Journal, Agricultural and Resource Economics: International Scientific E-Journal, vol. 2(1), March.
    11. A. E. Ades & G. Lu & K. Claxton, 2004. "Expected Value of Sample Information Calculations in Medical Decision Modeling," Medical Decision Making, , vol. 24(2), pages 207-227, March.
    12. 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.
    13. Eduardo M. Azevedo & Alex Deng & José Luis Montiel Olea & Justin Rao & E. Glen Weyl, 2020. "A/B Testing with Fat Tails," Journal of Political Economy, University of Chicago Press, vol. 128(12), pages 4614-4000.
    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. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    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. Ran Ben-Moshe & Sergiu Hart & Noam Nisan, 2022. "Monotonic Mechanisms for Selling Multiple Goods," Papers 2210.17150, arXiv.org, revised Jun 2024.
    4. 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.
    5. Frank Yang, 2021. "Costly Multidimensional Screening," Papers 2109.00487, arXiv.org, revised Aug 2022.
    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. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    8. Ostrizek, Franz & Sartori, Elia, 2023. "Screening while controlling an externality," Games and Economic Behavior, Elsevier, vol. 139(C), pages 26-55.
    9. Bergemann, Dirk & Ottaviani, Marco, 2021. "Information Markets and Nonmarkets," CEPR Discussion Papers 16459, C.E.P.R. Discussion Papers.
    10. 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.
    11. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    12. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    13. 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.
    14. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    15. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    16. Yingkai Li, 2021. "Selling Data to an Agent with Endogenous Information," Papers 2103.05788, arXiv.org, revised Aug 2023.
    17. Dirk Bergemann & Alessandro Bonatti & Alex Smolin, 2018. "The Design and Price of Information," American Economic Review, American Economic Association, vol. 108(1), pages 1-48, January.
    18. Shixin Wang, 2024. "Semi-Separable Mechanisms in Multi-Item Robust Screening," Papers 2408.13580, arXiv.org.
    19. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    20. 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.

    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:cwl:cwldpp:2324. 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: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.html .

    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.