AI summary · arXiv: 2610.31693v1 · econ.GN

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

Krish Tadigotla
Original paper Submitted to arXiv on 20 Oct. 2026 12 pages, 10 figures, 2 tables License: NONEXCLUSIVE-DISTRIB 1.0

How to read this summary? Illustrated guide

The essentials

In a simulated two-seller market, lower AI operating costs do not necessarily translate into full price reductions for consumers.

Based on the abstract only: check the details in the original paper.

Question

The paper asks whether lower costs of running AI models reduce prices, and whether delays in observing rivals’ prices or limits on repricing affect consumer benefit. It also examines whether these effects vary with differences in firm quality and costs.

Method

The study simulates two differentiated sellers with logit demand and tabular Q learning. A factorial experiment varies rival-price information age, repricing frequency, cost reductions, and firm differences; it evaluates learned policies on 60 paired market seeds in each of 16 conditions, for 960 training runs, measuring expected consumer surplus after learning.

Findings

  • Result In the main setting with identical firms and falling costs, the estimated interaction between information delay and repricing frequency on consumer surplus was -0.00025 normalized units, with a 95% paired seed bootstrap interval spanning zero.
    See the passage in the paper
    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].
  • Result The intervals for whether the interaction changes with the cost regime or firm differences also include zero.
    See the passage in the paper
    The interval includes zero, as do intervals for tests of whether the interaction changes with the cost regime or differences between firms.
  • Result With the shortest information delay and the ability to revise prices every period, the two firms’ average price reductions equal 55.6% and 44.0% of the imposed cost reduction.
    See the passage in the paper
    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.
  • Result Learned-policy consumer surplus is below the corresponding static grid Nash benchmark in every experimental condition.
    See the passage in the paper
    Mean consumer surplus under the learned policies is below the corresponding static grid Nash benchmark in all 16 conditions.
  • Authors’ interpretation The authors conclude that simulated cost savings need not be fully passed on to buyers, while cautioning that the study does not establish collusion or characterize actual AI providers.
    See the passage in the paper
    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.

Limitations

  • The results come from a simulated market and do not establish how actual AI providers set prices.
    See the passage in the paper
    They do not establish collusion or describe pricing by actual AI providers.
  • The study’s scope is limited to two differentiated sellers with logit demand and tabular Q learning.
    See the passage in the paper
    We study a simulated market with two differentiated sellers, logit demand, and tabular Q learning.

Why it matters

The authors argue that simulated reductions in AI operating costs need not be fully passed on to consumers. Their findings do not establish collusion or describe pricing by actual AI providers.

Written by AI from the paper. Passages are checked word for word against the text we analysed; the rest may contain errors.

AI-generated keywords: algorithmic pricing information delays cost pass-through consumer surplus reinforcement learning

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
Krish Tadigotla’s paper, “When AI Gets Cheaper, Do Prices Follow? Information Delays and Algorithmic Pricing,” asks whether lower AI operating costs lead sellers to lower prices, and whether the effect depends on how quickly they learn competitors’ prices and how often they can revise their own. The question matters because cost savings do not automatically benefit consumers, particularly when sellers use algorithms to set prices. The available material includes only the title, author information, and abstract. This summary is therefore limited to the methods and findings reported in the abstract. The study simulates a market with two differentiated sellers, logit demand, and tabular Q-learning. Its factorial experiment varies four features: the age of the information sellers have about a rival’s price, how frequently they can revise their own prices, whether production costs fall, and whether the firms differ in quality or cost. The researchers evaluate learned pricing policies using 60 paired market seeds in each of 16 experimental conditions, for 960 training runs in total. Their main outcome is expected consumer surplus after learning ends. In the main setting—where firms are identical and production costs fall—the estimated interaction between the delay in rival-price information and repricing frequency on consumer surplus is −0.00025 normalized units. The 95% paired-seed bootstrap interval is [−0.0402, 0.0393], which includes zero. This estimate therefore provides no clear evidence that the combination of information delays and repricing frequency affects consumer surplus in that setting. The abstract also reports that interaction-test intervals include zero when the researchers assess whether this relationship varies by cost regime or by differences between firms. The simulations nevertheless indicate that cost reductions are not always passed through fully to consumers. 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 sellers, respectively. These figures suggest incomplete pass-through even under relatively favorable conditions for monitoring and adjusting prices. Mean consumer surplus under the learned policies is also below the corresponding static grid Nash benchmark in all 16 conditions. The abstract does not explain how the benchmark is constructed or report the size of these gaps. The authors conclude that, in this simulated setting, lower costs do not guarantee proportionate price reductions or consumer gains. They emphasize that the findings do not establish collusion and should not be interpreted as a description of how actual AI providers set prices. The study’s scope and the limited available evidence call for caution. Its results come from a model with two differentiated sellers, logit demand, and a particular tabular learning method—not from observed markets or real pricing systems. The abstract also lacks enough detail to assess the model’s assumptions, robustness checks, or the economic significance of the consumer-surplus differences. The findings are best understood as results from a specific simulation, not as a general empirical claim about AI-related costs or real-world pricing.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

How to chat with this paper? Illustrated guide

Compare with the PDF

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts Citation alerts guide
Weekly letter Presented in "Economics and finance this week" of 26 October 2026. Economics and finance this week: When better rules change the game
Journal club Premium+ Slides to present it

Papers around this one

See them on a map

Ranked by how close their title and abstract are to this paper’s. Select some to read them together.

Closest papers

  1. Very close Cited by this paper
    Artificial Intelligence, Algorithmic Pricing, and Collusion
    Emilio Calvano, G. Calzolari, V. Denicoló et al. · 2020 · The American Economic Review · Not summarized yet
    Abstract

    Increasingly, algorithms are supplanting human decision-makers in pricing goods and services. To analyze the possible consequences, we study experimentally the behavior of algorithms powered by Artificial Intelligence (Q-learning) in a workhorse oligopoly model of repeated price competition. We find that the algorithms consistently learn to charge supracompetitive prices, without communicating with one another. The high prices are sustained by collusive strategies with a finite phase of punishment followed by a gradual return to cooperation. This finding is robust to asymmetries in cost or demand, changes in the number of players, and various forms of uncertainty. (JEL D21, D43, D83, L12, L1…

  2. Close
    Algorithmic pricing and export prices: implications for international competition
    Selin Ayaz · 2026 · Interpersona : An International Journal on Personal Relationships · Not summarized yet
    Abstract

    This study examines, within an analytical and holistic framework, how artificial intelligence (AI) and machine learning-driven algorithmic pricing systems are reshaping pricing behavior in international trade, firms’ profit margins (markups), and the broader dynamics of global competition. It focuses on three main research questions: the forms of market power generated by algorithmic pricing in export markets, the ways in which international organizations address the risks of digital monopolization and tacit collusion associated with autonomous pricing systems, and the regulatory gaps embedded in existing global trade rules. Methodologically, the study adopts a qualitative research design ba…

  3. Close Cited by this paper
    Competition in Pricing Algorithms
    Zach Y. Brown, Alexander Mackay · 2020 · Social Science Research Network · Not summarized yet
    Abstract

    We document new facts about pricing technology using high-frequency data, and we examine the implications for competition. Some online retailers employ technology that allows for more frequent price changes and automated responses to price changes by rivals. Motivated by these facts, we consider a model in which firms can differ in pricing frequency and choose pricing algorithms that are a function of rivals’ prices. In competitive (Markov perfect) equilibrium, the introduction of simple pricing algorithms can increase price levels, generate price dispersion, and exacerbate the price effects of mergers. (JEL D21, D22, D43, G34, L13, L81)

  4. Close
    How language model agents reshape price competition
    M. Bichler, Philip Hierhager, Kassian Köck et al. · 2026 · Not summarized yet
    Abstract

    Repeated Bertrand competition is a stringent benchmark for algorithmic pricing: in homogeneous-goods markets, standard learning procedures typically select the stage-game Nash outcome with prices near marginal cost. We show that LLM pricing agents can escape this benchmark, depending on deployment decisions. LLMs outperform standard online learners through faster adaptation, but this advantage largely disappears against full-information learners. An extracted surrogate algorithm illustrates how LLMs in specific deployments profit from regularly undercutting slower learners. Agents that post one price every period from raw market histories that include rival prices can sustain supracompetitiv…

  5. Close Cited by this paper
    Artificial Collusion: Examining Supracompetitive Pricing by Q-Learning Algorithms
    A. D. den Boer, J. Meylahn, M. Schinkel · 2026 · Social Science Research Network · Not summarized yet
    Abstract

    We examine concerns that pricing algorithms, employing reinforcement learning, used by competitors would autonomously and systematically learn to collude. Findings of supracompetitive prices with Q-learning have recently raised that alarm. However, a detailed analysis of the inner workings of this algorithm type reveals that it often does not satisfy conditions for what constitutes “autonomous” algorithmic collusion that would be a cartel risk in practice. We find that Q-learning can learn collusive equilibria only on timescales irrelevant to the firm’s objective. Competitors are committed to using the same Q-learning algorithm, starting at the same moment, with the same hyperparameters and …

  6. Close
    The Hidden Cost of Convenience: How Algorithmic Pricing Hurts Vulnerable Consumers
    Oluwafemi Akinwande · 2026 · WORLD JOURNAL OF INNOVATION AND MODERN TECHNOLOGY · Not summarized yet
    Abstract

    It has become a concern in the global business circle over the rise of algorithmic pricing and Artificial Intelligence (AI)-driven personalized pricing models which has redesigned digital commerce, allowing industries and organizations to adjust prices dynamically and drastically. Consequent upon the fact that these models rely on consumer data, urgency, and behavioral triggers, they often result in price discrimination and reduced market transparency thereby hurting vulnerable consumers. Algorithmic price calculation is by far one of the most remarkable features of the present-day consumer economy, which to an extraordinarily makes use of data to discover market conditions and the individua…

  7. Close
    EXPRESS: Learning to Price under Competition with Reference Price Effects
    Yong-Ge Yang, Jian-Nan Ke, Cong Shi · 2026 · Production and operations management · Not summarized yet
    Abstract

    This paper studies the algorithmic design of price competition in oligopolistic markets, with a focus on long-run market dynamics under reference price effects. We consider a sequential price competition framework with multiple sellers operating over a finite horizon, each lacking prior knowledge of the demand functions. Consumer demand depends not only on current prices but also on a reference price, defined as a weighted average of past prices that shapes consumer expectations. We characterize market stability through the concept of a stationary Nash equilibrium (SNE), where no seller has an incentive to deviate unilaterally and the reference price remains stable. To operate under incomple…

  8. Close Cited by this paper
    The Emerging Market for Intelligence: How Firms Buy and Sell AI
    Mert Demirer, Andrey Fradkin, Nadav Tadelis · 2026 · Journal of Economic Perspectives · Not summarized yet
    Abstract

    We describe the emerging business-to-business market for large language model (LLM) inference and document key empirical patterns in its supply, pricing, and dynamics, using data from OpenRouter. First, supply has expanded rapidly: the number of commercially available models, model creators, and inference providers has grown sharply, driven heavily by opensource entrants. Second, the price of intelligence has fallen roughly a thousandfold, and opensource models now cost about 90 percent less than comparable closed-source ones. Third, the market is highly dynamic, with frequent turnover among leading models and creators. Fourth, we document substantial horizontal and vertical differentiation:…

Prior work it builds on

  1. Related
    Algorithmic Collusion Without Deterrence: Auditing the Punishment Mechanism in Q-Learning Pricing Agents
    Kauê L. P. de Moraes, Rodrigo De-Losso · 2026 · Not summarized yet
    Abstract

    Independent tabular Q-learning agents repricing in a simulated Bertrand duopoly converge to supracompetitive prices, and the seminal evidence attributes this to a learned reward-punishment scheme: undercut your rival and it retaliates, so deviation never pays. This mechanistic reading is what turns high prices into a cartel, and into a regulatory target. We replicate the environment of Calvano et al. (2020) and confirm their impulse-response pattern within co-trained pairs. We then audit the pattern on frozen policies, with learning off, and find that on its own it does not identify a mechanism: the return is over-determined rather than selective. In nine of ten converged pairs (914 of 1,024…

  2. Related
    Algorithmic collusion under sequential pricing and stochastic costs
    Gonzalo Ballestero · 2026 · International Journal of Industrial Organization · Not summarized yet
  3. Related
    Menu Pricing of Large Language Models
    D. Bergemann, Alessandro Bonatti, Alex Smolin · 2025 · Not summarized yet
    Abstract

    We develop a framework for the optimal pricing and product design of LLMs in which a provider sells menus of token budgets to users who differ in their valuations across a continuum of tasks. Under a homogeneous production technology, we show that users'high-dimensional type profiles are summarized by a scalar index, reducing the seller's problem to one-dimensional screening. The optimal mechanism takes the form of committed-spend contracts: buyers pay for a budget that they allocate across token classes priced at marginal cost. We extend the analysis to environments with multiple differentiated models and to competition between a proprietary leader and an open-source fringe, showing that co…

How are these papers found?

We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.

Updated on 31 October 2026.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.