IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.04345.html

Strategic Information Disclosure in Algorithmic Pricing

Author

Listed:
  • Chengcheng Wang
  • Zexin Ye

Abstract

As firms increasingly adopt AI-powered pricing algorithms, a key and urgent policy concern is how to regulate the potential algorithmic collusion. This paper approaches the regulatory question through the lens of information design and examines how different disclosure rules, committed to by a third-party intermediary, shape learning outcomes when firms delegate pricing to Q-learning algorithms under stochastic demand. We analyze three disclosure rules: no disclosure, full disclosure, and upper censorship. Upper censorship, which truthfully reveals low-demand states while pooling high-demand ones, delivers higher profits than full disclosure, consistent with theoretical predictions. However, we uncover a profit reversal: when the discount factor is high, no disclosure yields higher profits than full disclosure, whereas when the discount factor is low, full disclosure performs better. This pattern is exactly the opposite of what classical collusion theory predicts. Overall, these findings show that Q-learning agents respond systematically to the information structure and further suggest that restricting information sharing may backfire when algorithms are sufficiently patient, highlighting the need to reassess regulatory approaches in AI-mediated markets.

Suggested Citation

  • Chengcheng Wang & Zexin Ye, 2026. "Strategic Information Disclosure in Algorithmic Pricing," Papers 2607.04345, arXiv.org.
  • Handle: RePEc:arx:papers:2607.04345
    as

    Download full text from publisher

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

    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:arx:papers:2607.04345. 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: arXiv administrators (email available below). General contact details of provider: https://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.