arXiv · 2102.09139
Algorithmic pricing with independent learners and relative experience replay
Abstract
In an infinitely repeated general-sum pricing game, independent reinforcement learners may exhibit collusive behavior without any communication, raising concerns about algorithmic collusion. To better understand the learning dynamics, we incorporate agents' relative performance (RP) among competitors using experience replay (ER) techniques. Experimental results indicate that RP considerations play a critical role in long-run outcomes. Agents that are averse to underperformance converge to the Bertrand-Nash equilibrium, while those more tolerant of underperformance tend to charge supra-competitive prices. This finding also helps mitigate the overfitting issue in independent Q-learning. Additionally, the impact of relative ER varies with the number of agents and the choice of algorithms.
Explore related subjects
Keep this discovery
Bingyan Han. 2021-02-18. Algorithmic pricing with independent learners and relative experience replay. https://arxiv.org/abs/2102.09139
Cite the original work for its findings. Save a collection to share your selection of sources.