Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in a finite-dimensional approximation of Bayesian Bertrand competition with private costs.
Autonomous algorithmic collusion: Q-learning under sequential pricing.The RAND Journal of Economics, 52(3):538–558
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Convergence of Stochastic First-Order Algorithms in Bertrand Competition Under Incomplete Information
Euclidean RRM algorithms converge almost surely to the unique efficient Bayes-Nash equilibrium in a finite-dimensional approximation of Bayesian Bertrand competition with private costs.