Domenico Mergoni Cecchelli

collaborators

3 papers

cs.GT2026

The Bounds of Algorithmic Collusion; $Q$ -learning, Gradient Learning, and the Folk Theorem

Galit Askenazi-Golan, Domenico Mergoni Cecchelli, Edward Plumb +1

We explore the behaviour emerging from learning agents repeatedly interacting strategically for a wide range of learning dynamics, including $Q$ -learning, projected gradient, repli…

cs.GT2025

Simultaneous Best-Response Dynamics in Random Potential Games

Galit Ashkenazi-Golan, Domenico Mergoni Cecchelli, Edward Plumb

This paper examines the convergence behaviour of simultaneous best-response dynamics in random potential games. We provide a theoretical result showing that, for two-player games w…

math.CO2025

On product Schur triples in the integers

LetÃcia Mattos, Domenico Mergoni Cecchelli, Olaf Parczyk

Schur's theorem states that in any $k$ -colouring of the set of integers $[n]$ there is a monochromatic solution to $a + b = c$ , provided $n$ is sufficiently large. Abbott and Wang stud…

The Bounds of Algorithmic Collusion; Q-learning, Gradient Learning, and the Folk Theorem

Simultaneous Best-Response Dynamics in Random Potential Games

On product Schur triples in the integers

The Bounds of Algorithmic Collusion; $Q$ -learning, Gradient Learning, and the Folk Theorem