4 citations · 7 across the 8 of their papers we have counts for
Showing econ.THShow all
2 papers · 1 filter
econ.TH2025
Algorithmic Collusion is Algorithm Orchestration
Cesare Carissimo, Fryderyk Falniowski, Siavash Rahimi +1
We propose a fresh `meta-game' perspective on the problem of algorithmic collusion in pricing games a la Bertrand. Economists have interpreted the fact that algorithms can learn to…
econ.TH2025
Cycles and collusion in congestion games under Q-learning
Cesare Carissimo, Jan Nagler, Heinrich Nax
We investigate the dynamics of Q-learning in a class of generalized Braess paradox games. These games represent an important class of network routing games where the associated sta…