Skip to content
Open access

When do pricing algorithms intensify competition? A theory of online oligopoly

Aug 2026 · Digital Enterprise Studies · 0 citations · 64 references

Abstract

Online sellers increasingly delegate pricing to rules that respond mechanically to rivals’ posted prices. This paper studies such rules in a differentiated Bertrand model in which a seller’s pricing technology is a response speed and a rule slope, and shows that rivals’ technologies enter a seller’s problem only through their product, a single induced conduct parameter measuring the total price response rivals make to a unilateral price change. Any intercept in the rule, including a fixed undercutting margin, is neutralized by optimal base pricing, so the aggressiveness that repricing software advertises has no equilibrium effect on its own. Conditional on the installed technology profile, the equilibrium posted price rises continuously in the conduct parameter, from the static Nash price under manual pricing to the joint-profit-maximizing price as symmetric matching approaches completion. The mechanism operates in the induced base-price game and requires no punishment path, no discount factor and no history dependence, which makes the boundary case an algorithmic restatement of the classical meeting-competition-clause result. The conduct representation is what the paper builds on, because it delivers comparative statics in market size, heterogeneous adoption, consumer search and entry within a single framework. Under partial adoption, non-adopters face a higher conduct parameter than adopters and price above them, while the market average price is higher under full adoption than under none; the shape of the average price in between is a numerical rather than an analytical result. Consumer search restrains prices when relative prices can move, and that restraint disappears in the full-matching limit. Free entry absorbs a substantial share of the price effect in the reported calibrations, and against a manually pricing entrant, incumbent matching makes entry easier while adoption is partial and harder as matching approaches completion. The model implies that the sign and size of the measured effect of algorithmic pricing should track market contestability and the responsiveness of rivals’ prices rather than the sophistication of the pricing algorithm, which is consistent with evidence that price effects appear in concentrated retail gasoline markets but not in the large e-commerce marketplace for which comparable evidence is available.

Read PDF

Similar papers

Open access Sep 2026

EXPRESS: Learning to Price under Competition with Reference Price Effects

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 functi...

Yong-Ge Yang, Jian-Nan Ke, Cong Shi · 0 citations
Conference Open access Sep 2026

Pricing and Returns Under Reversed Information Asymmetry

This project extends a game-theoretic model of monopoly pricing and return policy under three information structures: an uninformed firm, an equally informed firm that observes consumer type, and a firm that observes consumer type and a consumer's own realized product valuation before they do themselves, a "reversed in...

Rishab Chakraborty · 0 citations
#reinforcement learning Open access Sep 2026

AI-Driven Dynamic Pricing and Advertising in E-Commerce Competition: A Differential Game Analysis of Coordination Reversal and Welfare

The framework provides an analytical characterization of a mechanism that can generate the lower-price coordination outcome reported in recent computational research, clarifying conditions under which multidimensional coordination can be associated with consumer-beneficial rather than purely anticompetitive outcomes.

Mian Haseeb Mushtaq, Aiman Ejaz, Talha Zubair · 0 citations
Preprint Oct 2026

Delegate Pricing to Algorithms: When Slow and Steady Wins the Race

We study the strategic design of learning algorithms in a canonical continuous-time pricing game. We introduce a meta-game in which firms select learning rates for a gradient dynamic, evaluating payoffs as the discounted sum of profits accrued along the entire learning path. We uncover a fundamental dichotomy driven by...

Galit Ashkenazi-Golan, Edward Plumb, Clemens Possnig et al. · 0 citations
Aug 2026

EXPRESS: Assortment Display, Price Competition and Fairness in Online Marketplaces

This work develops a Stackelberg game in which the platform chooses the display policy, and sellers subsequently set prices in response to the competitors they face within their assigned partition, and develops an algorithm that effectively solves seller partitions, traffic allocation, and equilibrium prices.

Hongyu Chen, Hanwei Li, D. Simchi-Levi et al. · 1 citation
Open access Oct 2026

Dynamic Offer Selection and Buy-Now Decisions on Resale Platforms: A Finite-Horizon Dynamic Programming Model

Digital resale platforms allow buyers to either purchase at a posted price or submit a lower offer subject to uncertain seller acceptance. This study develops a stylized finite-horizon dynamic program in which the buyer jointly chooses whether to bid and how much to offer while retaining a buy-now fallback. A savings t...

Jae-dong Son, Chevin Ahn, Gyumin Jung · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.