econ.GNMay 28, 2025

Learning to Charge More: How Q-Learning Firms Lock In Supracompetitive Prices

Authors: Cristian Chica, Yinglong Guo, Gilad Lerman

Organizations: School of Mathematics, University of Minnesota.

Abstract

There is growing experimental evidence that QQ-learning agents can learn to charge supracompetitive prices. We ask when such behavior persists, whether it emerges, and which strategies support it. In a repeated pricing game in which firms condition on the previous period's price profile, we give conditions on the learned action values under which supracompetitive prices become an absorbing state once experimentation ends. We then show that under softmax exploration these conditions are reached with positive and explicitly bounded probability, both from a random and from an all-zero initial QQ-table. In the latter case firms lock in supracompetitive prices because they never learn that undercutting pays; the same mechanism can lock in the competitive price, so the long-run outcome is selected by the exploration path. Finally, we give sufficient conditions on the learned table under which the induced strategy is naive collusion, a grim trigger strategy or an increasing-price strategy; grim trigger strategies are subgame perfect under a standard discounting condition, whereas naive collusion is generally not an equilibrium.

Explore similar work

CardsList
  1. Equilibrium stability as a driver of cooperation among Q-learners

    Jul 15, 2026Janusz M. Meylahn, Maximilian SchäferGame-Playing AgentsRepeated Games

  2. Persistent Partners Raise Prices Among Learning Agents

    Sep 28, 2026Paul-Peter Arslan, Yubin Kim, Xiao XiaoAlgorithmic CollusionMulti-Agent Systems

  3. Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices

    May 15, 2026Jackie Baek, Vivek F. Farias, Farrell WuPredict-Then-OptimizeLearning to Optimize