This paper investigates whether online learning algorithms in pricing produce competitive outcomes or tacit collusion. This issue has drawn considerable attention from competition regulators as algorithmic pricing becomes more common in digital markets. Understanding when such algorithms lead to equilibrium or supra-competitive prices is critical for buyers, sellers, and policymakers. We study the behavior of multi-armed bandit (MAB) online learning algorithms in repeated price competition. These algorithms require little information to learn, making them realistic models of automated pricing. Our analysis shows that mean-based algorithms, a special variant of online learning algorithms, converge to correlated rationalizable actions. In the Bertrand environments considered, this implies convergence to the Nash equilibrium or adjacent prices. Numerical experiments reveal that most MAB algorithms, including those that are not mean-based, also converge. We observe supra-competitive prices only in specific cases where all sellers implement the same symmetric version of certain algorithms, such as UCB. This effect diminishes as the number of competitors increases. Our results suggest that, even in a stylized repeated Bertrand competition, sustained supra-competitive prices may be less of a concern when independent agents use different online learning algorithms. Our insights are relevant for regulators and managers considering the use of algorithmic pricing algorithms.

翻译：暂无翻译