Working Papers
Algorithmic collusion with endogenous exploration (Draft)
Abstract: I study a two-stage model in which two players simultaneously choose an exploration parameter for their Q-learning algorithms, which then repeatedly play a one-shot game chosen from a class of social dilemmas including the prisoner’s dilemma, first and second price auctions as well as Bertrand competition with horizontally differentiated products. The players collect the limit average payoffs obtained by their algorithms. I show that in equilibrium, both players receive payoffs that are strictly higher than the payoffs received in the unique strict Nash equilibrium of the one-shot game. The case of the repeated prisoner’s dilemma is then studied using extensive numerical simulations. Their results allow to gain insight on (i) the mechanism causing algorithmic collusion and (ii) the strategic role of exploration levels in the game. These findings have important implications for algorithmic collusion.
Presentations : Tom Seminar (PSE), GAIMSS'24 (Metz), SASCA 2024 (Ca' Foscari), Asian School in Economic Theory (NYU Abu Dhabi), Doctorissimes 2025 (PSE), International Conference in Game Theory 2025 (Stony Brook)
Recommender systems and efficient social learning (Draft)
Abstract: In this paper, I study a model of a streaming platform (for instance YouTube or Netflix) with a catalog of items whose quality are unknown. Short-lived users arrive in sequence and browse the catalog, paying a small cost each time they want to examine a new alternative. The platform observes their behavior and uses it to deduce information about the items' quality so as to enhance future user's experience. I show that the platform is able to distinguish high-quality items if and only if a condition linking the cost of browsing and the thickness of the tail of the distribution from which the quality of the items is drawn holds true. This condition relates to the ability of the platform to incentivize users to explore new items using the information gathered with the previous users. I pin down an easily implementable policy that guarantees efficient learning.
Presentations : Theory Workshop PSExTSE (PSE), Parisian Game Theory Festival (Institut Henri Poincaré), GAIMSS'25 (Toulouse), SASCA 2025 (Sassari), AMSE PhD Seminar, Junior Game Theory Seminar (Institut Henri Poincaré) , Tom Seminar (PSE), ASSET 25 (UM6P), Midwest Econ Theory Conference (PennState)
Published Papers
Work in progress
Hawkes processes and spatial prisoner's dilemma (with Gaspard Abel and Argyris Kalogeratos)
Algorithmic collusion with unsynchronized updating (with Gaspard Abel and Argyris Kalogeratos)