74 citations · 144 across the 12 of their papers we have counts for
3 papers · 1 filter
Minimizing Volatility: Optimal Adjustment with Evolving Feasibility Constraints
Simon Jantschgi, Heinrich H. Nax, Bary S. R. Pradelski +1
Minimizing volatility and adjustment costs is of central importance in many economic environments, yet it is often complicated by evolving feasibility constraints. We study a decis…
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…
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…