Market History Visibility and High Prices in LLM Pricing Agents
Yanduo Yang, Yahan Yang, Zilin Huang · Team TriSpark
Submitted to AI Collusion Research Sprint. Sprint projects are early-stage work by participants, not Apart Research publications.
Abstract High and similar prices in repeated pricing games may reflect strategic coordination, but they may also arise when agents cannot revise an initial pricing assumption. We examine this distinction in a differentiated-product duopoly with two DeepSeek Flash agents. We compare one 30-round run with a 100-round visible-history window against one run with no visible market history, while retaining persistent private notes in both conditions. With history, prices fall from approximately 2.75, temporarily stabilize near 1.72, and finish at 1.58. Recorded statements describe attempts to maintain or increase prices, but a higher-price convention does not persist. Without history, prices remain at 2.76 and 2.75 throughout the game. Over the final ten rounds, mean per-agent price is 1.698 with history and 2.755 without history, whereas mean profit is 30.066 and 7.805, respectively. The no-history records describe missing market feedback and repeated use of an initial demand assumption. These observations illustrate why high prices alone cannot identify the mechanism behind pricing behavior. The study is exploratory: each condition has only one run, and removing market history simultaneously removes own-outcome feedback and information about the competitor. The findings motivate joint examination of prices, profits, and decision records when evaluating possible algorithmic collusion.
Reviews
This is a carefully scoped case study. It shows that a price-above-Nash screen flags two runs with very different underlying mechanisms. The paper does an unusually good job of separating what was observed from how it is interpreted. It states the history/feedback confound, admits that the analysis window was chosen after inspection, and avoids claiming collusion. The suggested next experiment, hiding rivals’ prices while keeping each agent’s own feedback, is exactly the right one. The concerns are mainly about how much the design can show and about one under-analyzed result.
The no-history result follows directly from the prompt. With memory=0, each round is effectively a fresh one-shot decision. The paper notes that the agent still thinks it is in round 1 at round 30. So this is closer to “one-shot vs repeated game” than to a test of history visibility within a repeated game. The specific price comes straight from the starter framework’s prompt, which tells agents the consumer willingness-to-pay (4.51). Taking the midpoint between cost (1) and that value gives the 2.755 price exactly. The paper should trace the price to that prompt detail. It would then be clear the result is driven by the prompt rather than specific to the model, and that any LLM given the same prompt would likely land near the same price.
The history run deserves more analysis than it gets. In rounds 21–30, its mean profit (30.07) is about 68% of the way from Nash (22.29) to joint-profit (33.75), and its mean price is about 50% of the way. By the profit-based collusion index in Calvano et al. and Fish et al., that is a substantial supracompetitive outcome. The decision records also describe a “tacit convention.” The paper presents this run mainly as a failed convention, based on the final two rounds. With only 30 rounds, compared with the 300 typical in the Fish et al. setup, it can’t tell whether that drop is a breakdown, a temporary price war, or noise. Ironically, the run with lower prices may be the stronger collusion case, and that is the paper’s own thesis. It should say so directly.
There is too little data for the comparison. One run per condition, 30 rounds each, at temperature 0.7, and seed 0 isn’t even passed through to the API, as the authors note. Five to ten runs per condition with longer horizons would make the contrast and the history-run dynamics interpretable. The rounds 21–30 window should be fixed in advance or justified, e.g. by matching standard practice.
Reproducibility. The numbers were “retained from the experiment report and not independently recomputed,” and no raw JSON or Parquet records or launcher script are released. The run IDs document where the results came from, but nobody can check them. Releasing the two run folders would cost little and settle this.
Minor. The keyword list and framing put “collusion auditing” up front, but the paper doesn’t test a detector. The audit checks it proposes (responses to rivals’ prices, sustained joint gains, behavior after deviations) would make a natural follow-up, and the history run is the place to try them.
Suggestions: Run the factorial design the authors already propose (own feedback × rival-price visibility), with several runs per cell and about 100+ rounds. Report both price-based and profit-based indices. Release the raw trajectories.
Read full reviewShow less
Cite this project
@misc{yang2026market,
title = {{Market History Visibility and High Prices in LLM Pricing Agents}},
author = {Yanduo Yang and Yahan Yang and Zilin Huang},
year = {2026},
month = oct,
note = {Submitted to AI Collusion Research Sprint, an Apart Research Sprint},
howpublished = {\url{https://apartresearch.com/sprints/projects/market-history-visibility-and-high-prices-in-llm-pricing-agents-rpul}},
url = {https://apartresearch.com/sprints/projects/market-history-visibility-and-high-prices-in-llm-pricing-agents-rpul}
}More from AI Collusion Research Sprint
- View project: Signal or Coincidence ? Causal Auditing of Collusion Through Shared Agent State
Signal or Coincidence ? Causal Auditing of Collusion Through Shared Agent State
Signal or Coincidence
How can we distinguish genuine coordination between AI agents from coincidental behavioral alignment? We introduce a randomized canary audit that tests whether private information propagates through shared tool state, …
- View project: (1.4) Collusion, Espionage, or Look-alikes? Auditing Information Flow between LLM Agents
(1.4) Collusion, Espionage, or Look-alikes? Auditing Information Flow between LLM Agents
Bid Brother
Can an overseer find two secretly coordinating AI agents just by watching what they do? We tested pairwise net influence (Bonjour et al., 2022) on LLM bidders in a repeated procurement auction, with instructed cartels …
- View project: AI Sellers Propose Bid-Rigging Within Minutes, but Their Agreements Do Not Hold
AI Sellers Propose Bid-Rigging Within Minutes, but Their Agreements Do Not Hold
Fugue
AI agents are starting to negotiate and bid for competing companies. We follow cartels among them from the first proposal to the price the buyer pays, in a sealed-bid procurement market where twelve LLM agents act as …