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

When AI Gets Cheaper, Do Prices Follow? Information Delays and Algorithmic Pricing

Author

Listed:
  • Krish Tadigotla

Abstract

We examine whether lower costs of running AI models lead to lower prices, and whether delays in observing competitors' prices and limits on price changes affect how much consumers benefit. We study a simulated market with two differentiated sellers, logit demand, and tabular Q learning. A factorial experiment varies the age of rival price information, how often sellers can revise prices, whether production costs fall, and differences in firm quality and costs. We evaluate policies trained on 60 paired market seeds in each of 16 conditions, for 960 training runs, and measure expected consumer surplus after learning ends. In the main setting with identical firms and falling costs, the estimated interaction between information delay and repricing frequency on consumer surplus is -0.00025 normalized units, with a 95% paired seed bootstrap interval of [-0.0402, 0.0393]. The interval includes zero, as do intervals for tests of whether the interaction changes with the cost regime or differences between firms. With the shortest information delay and the ability to revise prices every period, average price reductions equal 55.6% and 44.0% of the imposed cost reduction for the two firms. Mean consumer surplus under the learned policies is below the corresponding static grid Nash benchmark in all 16 conditions. The findings show that simulated cost savings need not be fully passed on to buyers. They do not establish collusion or describe pricing by actual AI providers.

Suggested Citation

  • Krish Tadigotla, 2026. "When AI Gets Cheaper, Do Prices Follow? Information Delays and Algorithmic Pricing," Papers 2610.31693, arXiv.org.
  • Handle: RePEc:arx:papers:2610.31693
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2610.31693
    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:2610.31693. 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.