Econ-78 · economics · Economics

Econ-78

Algorithmic pricing conduct

LLM status Open unverified

L13 — Oligopoly and Other Imperfect Markets Economics catalogue openaigpt 6 astra ultra 20% cataloguednot recordedOpen

Statement

Original subject group: Industrial organization and competition

Audit classification: Explicit published open question. The source explicitly asks about pricing-algorithm welfare. The original phrase survives unilateral replacement did not define profits or a deviation criterion; a quantity-weighted mean also needed a nonzero denominator.

Definitions and precise research target

Consider one market with $N\geq2$ incumbent firms and an infinite sequence of periods; evaluate its first $T$ periods for increasing positive integer horizons $T$. Each active firm sets a price in a common compact interval, faces a specified demand function, and has observed production costs. Pricing programs learn from past public prices, quantities and their own profits; they exchange no direct messages. Potential entrants face a specified entry-cost distribution and decide when to enter. For an algorithm class $\mathcal A$, define $\bar p(a)$ as the quantity-weighted mean price generated by algorithm profile $a\in\mathcal A^N$, averaged over learning randomness and demand shocks. Let $p^B$ be the corresponding price benchmark from the same environment with independently optimal one-period pricing and identical entry opportunities and a specified equilibrium-selection rule; entrant algorithms are fixed separately in both comparisons. For a prespecified economically material threshold $\varepsilon>0$, identify conditions under which $\bar p(a)-p^B\geq\varepsilon$ persists as $T$ increases and survives unilateral algorithm replacement. Include perturbations of demand, exploration rates and entrant behavior, and distinguish reciprocal punishment from unilateral pricing commitment. Report which conditions depend on algorithm architecture or market stationarity. This proposed dynamic specification extends a research agenda about sophisticated pricing; it is not a claim that a particular learning program necessarily colludes or that elevated prices prove communication.

Definitions, assumptions and mathematical qualifications. Fix one infinite-history environment and examine its first $T$ periods, rather than changing the game arbitrarily with $T$. Each program is a measurable map from its available history and random seed to a price; entrants' policies and entry law are input data. Define $\bar p_T(a)=E[\sum_{tj}p_{jt}q_{jt}]/E[\sum_{tj}q_{jt}]$ with denominator bounded below by $q_{\min}T>0$. Specify a static-pricing benchmark $p_T^B$ using the same shocks and entry technology. Persistence means $\liminf_{T\to\infty}(\bar p_T(a)-p_T^B)\geq\varepsilon$. To formalize survival of replacement, define $U_{j,T}(a)=T^{-1}E[\sum_{t\leq T}(p_{jt}q_{jt}-C_j(q_{jt}))]$ and require $\limsup_T\{U_{j,T}(a'_j,a_{-j})-U_{j,T}(a)\}\leq0$ for every allowed replacement $a'_j$. An elevated price alone is not an equilibrium or a communication test.

Variants and assumption changes

  1. Editorial, fixed learners. For specified learning updates, exploration schedules and initialization distributions, estimate or prove price and profit limits; distinguish algorithm performance from stability to replacement.
  2. Editorial, program equilibrium. Let firms choose from a finite or compact program menu and impose the profit-deviation condition. Compare stationary demand with a declared class of time-varying demand and entry shocks.

References and source audit

Checked source. 24 August 2024 author draft, Section 6, printed p. 37, fourth research direction. Full primary text retrieved. https://web.stanford.edu/~ayurukog/trendsincompetition.pdf.
  1. Carl Shapiro; Ali Yurukoglu. 2024. Trends in Competition in the United States: What Does the Evidence Show?. 24 August 2024 author draft, Section 6, printed p. 37, fourth research direction. https://web.stanford.edu/~ayurukog/trendsincompetition.pdf. DOI: https://doi.org/10.3386/w32762.

Common conventions: Source mathematical conventions

These conventions apply to each entry unless explicitly replaced.

Models and identification. A primitive model $m$ specifies all probability laws, feasible choices, information, equilibrium and measurement rules used by its target. The admissible class $\mathcal M$ is fixed independently of outcomes. If $P_O(m)$ is its observable probability law and $\tau(m)$ the target, its identified set at observable law $P$ is \[ \mathcal I_\tau(P)=\{\tau(m):m\in\mathcal M,\ P_O(m)=P\}. \] Point identification means that this set is a singleton. An empty set signals incompatibility of data and assumptions. Coordinate bounds need not describe the joint set. Bounds are sharp only if every retained target is attainable or arbitrarily approachable by compatible models. Finite bounds require explicit restrictions on unobserved quantities; unrestricted confounding, hidden wealth, extrapolation or arbitrary equilibrium selection can yield uninformative sets.

Causal interventions. A potential outcome $Y_i(p)$ is the outcome under a complete policy regime $p$, including timing, financing, information and market spillovers. The target population and units are fixed before treatment. With interference, use the complete assignment vector or a justified exposure mapping; individual no-interference notation alone cannot identify an economy-wide intervention. A difference of mean potential outcomes does not require the cross-world joint distribution. Conditioning on post-treatment migration, survival, enrollment or employment changes the estimand and needs separate justification.

Statistical statements. An estimator, confidence set, forecast or test specifies a sampling law, model class and loss/coverage criterion. Uniform $(1-\alpha)$-coverage means $\inf_{m\in\mathcal M}\Pr_m\{\tau(m)\in C_n\}\geq1-\alpha$, or an explicitly asymptotic version. The whole parameter space trivially has coverage, so informativeness requires a stated width, risk or power objective. A forecasting improvement is relative to a named benchmark, information set and evaluation population.

Equilibrium and optimization. An equilibrium comprises feasible plans, optimality, beliefs where needed, budget constraints and all market/resource clearing. The primitives or a stated benchmark define each correspondence $\mathcal E(p;m)$. Nonemptiness is assumed or proved, never inferred just from compact policy sets. A selected-equilibrium target uses a declared selection rule; a robust target quantifies over all permitted equilibria. Use suprema or infima unless attainment is established. An $\varepsilon$-optimal policy is feasible and within $\varepsilon$ of the finite optimum value. Report an empty feasible set separately.

Welfare and accounting. Normative utility, interpersonal normalization, social weights, numeraire, discounting and the use of public receipts are primitives. Behavioral utility need not coincide with the welfare criterion. Household welfare includes ownership income and rents once; adding profits again to compensating variation generally double-counts them. A monetary equivalent is defined by an explicit transfer and price convention, with monotonicity and range conditions. Average effects, mechanism contributions, transfers and welfare losses are different targets. Infinite sums require convergence and dynamic feasible plans require terminal or no-Ponzi conditions.

Source versions. A working-paper date, revision date and journal publication year are distinguished. A DOI for a journal version is not automatically the DOI of an earlier manuscript. Locators refer to the stated version and printed pages where specified. A metadata-only check does not verify a claim about a full-text conclusion. Every entry's source subsection narrows the provenance claim accordingly.

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Econ-78-A1 · Exploration · LLM-generated · gpt 6 astra ultra ·

GPT 6 Astra Ultra attempt on Econ-78

Algorithmic pricing: replacement stability and a fragility calculation

Problem: L13-76. Status: Partial results; the complete catalogue target remains unresolved.

Problem and scope

The target asks whether above-benchmark prices persist and survive replacement of one firm's entire program. We give an exact repeated-Bertrand construction and a perturbation that destroys its price limit. The construction is a familiar punishment mechanism, included with the catalogue's average-profit quantifiers; it is not evidence that a particular reinforcement learner discovers it. Pricing-algorithm welfare is part of the agenda in Shapiro and Yurukoglu [SY].

A fully specified market

There are $N\ge2$ fixed incumbent firms, common constant marginal cost $c\ge0$, and price interval $[c,v]$, with $v>c$. Each period a mass $D_t\in[d_-,d_+]$ of unit-demand consumers values the good at $v$, where $0<d_-\le d_+<\infty$. They buy from the cheapest firms, splitting equally in a tie, including at price $v$. The sequence $(D_t)$ may be deterministic or random but is exogenous and has the same law under all program profiles. Firms observe the entire past price vector. There is no entry in this benchmark. Profit is $(p-c)q$ and the quantity-weighted price is defined by the ratio of expected total expenditure to expected total quantity. The static selected equilibrium has every firm price at $c$, so its benchmark price is $p_T^B=c$.

Fix $p^C\in(c,v]$. A program initially quotes $p^C$. It continues to do so while every previously observed firm price has been $p^C$; after the first deviation in the public price history it quotes $c$ forever. Detection occurs after the prices of the deviation period have been posted.

Theorem (Stable positive average-price gap): For the profile just defined, $\bar p_T=p^C$ for every $T$. For any firm $j$ and any replacement program $a'_j$, including randomized and horizon-dependent behavior within one infinite-history policy, \[ U_{j,T}(a'_j,a_{-j})-U_{j,T}(a) \le \frac{(v-c)d_+}{T}. \] Consequently the profile satisfies the catalogue's unilateral-replacement condition and has persistent price gap $p^C-c>0$.
Proof: Along the prescribed path all prices equal $p^C$, all demand is served, and each firm earns $(p^C-c)D_t/N$. Let $\tau$ be the first date at which the replacement program chooses a different price, with $\tau=\infty$ if this never happens. Couple the two profiles to the same exogenous demand path. Before $\tau$, quantities and profits coincide. At $\tau$, the replacement's incremental profit is bounded above by its entire period profit, at most $(v-c)d_+$. At every later date at least one other firm charges $c$. A replacement charging more sells nothing, while charging $c$ earns zero; prices below cost are outside the action interval. Its subsequent profit is therefore zero, whereas its counterfactual prescribed profit is nonnegative. This proves the pathwise cumulative upper bound even if $\tau$ depends on the history. Taking expectations and dividing by $T$ proves the inequality. The formula for the price follows because expenditure is exactly $p^C$ times served demand on the prescribed path. ∎
Proposition (A discounted credibility threshold): If, instead of the average criterion, each firm's payoff is the discounted sum with factor $\delta\in(0,1)$, a sufficient condition for the same profile to be a subgame-perfect equilibrium for every deterministic demand path in the stated bounds is \[ \frac{\delta (p^C-c)d_-}{N(1-\delta)}\ge (v-c)d_+. \]
Proof: After a deviation, all competitors price at cost, which makes cost pricing a stage best response after every history. Before a deviation, the one-period incremental gain is at most $(v-c)d_+$, and the discounted loss of future prescribed profits is at least the left side. Thus a first deviation cannot improve the discounted sum. The same comparison applies after each cooperative history; any multistage deviation has a first departure, after which continuation profits cannot be positive against cost pricing. This establishes the equilibrium claim without relying on an unverified learning limit. ∎

An explicit failure under experimentation

The following perturbation is deliberately precise. While the public state is cooperative, an externally generated experiment changes at least one firm's price away from $p^C$ with conditional probability at least $h>0$ each period. Prices remain in $[c,v]$. Once a change occurs, all firms switch permanently to $c$ and perform no further experiments. This isolates the absorbing effect of a single detected experiment; it does not describe persistent experimentation in the punishment state.
Proposition (The perturbed limiting price is the static benchmark): Under this experiment, $\bar p_T-c\longrightarrow0$. In fact, \[ 0\le \bar p_T-c\le\frac{(v-c)d_+}{h d_-T}. \]
Proof: The probability that no experiment has occurred before period $t$ is at most $(1-h)^{t-1}$, by repeated conditional expectation; independence is unnecessary. Expenditure in excess of $cD_t$ is zero after the experiment period and at most $(v-c)d_+$ before or during it. Its total expectation is at most $(v-c)d_+\sum_{t\ge1}(1-h)^{t-1}=(v-c)d_+/h$. Expected total quantity is at least $d_-T$. Dividing proves the bound. ∎

Remaining gap

Replacement stability and robustness to experimentation are separate properties: this exact construction has the former and fails the latter perturbation. It handles arbitrary bounded exogenous demand variation but excludes entry, heterogeneous costs, imperfect price observation, and persistent noisy punishment. None of the results show that elevated prices require communication, or that unrestricted real-world program replacement is unprofitable in a market with entry. The open task is to retain a quantitative gap under explicit learning updates and economically relevant perturbations, or prove an impossibility for that narrower class.

References

  • [SY] C. Shapiro and A. Yurukoglu (2024), Trends in Competition in the United States: What Does the Evidence Show?, author draft, Section 6. https://web.stanford.edu/~ayurukog/trendsincompetition.pdf. The source motivates the pricing-algorithm question; the elementary repeated-game and perturbation proofs here do not claim a result about the algorithms empirically studied in the source.

Completion Estimate

20%

Go to contribution →