Louis-Roy Langevin

Random Serial Dictartorship is \(\sqrt{2}\)-envy-free. (2026)

with Frank Connor, Ndiamé Ndiaye, Agnès Totschnig, Rohit Vasishta, & Adrian Vetta

In 27th ACM Conference on Economics and Computation (EC), 2026

The Popular Dimension of Matchings (2025)

with Frank Connor, Ndiamé Ndiaye, Agnès Totschnig, Rohit Vasishta, & Adrian Vetta

Proceedings of 21st Conference on Web and Internet Economics (WINE), 2025

Optimal root recovery for uniform attachment trees and \(d\)-regular growing trees (2024)

with Louigi Addario-Berry, Catherine Fontaine, Robin Khanfir, & Simone Têtu

Accepted to Annals of Applied Probability

On the Control of Mobile Ad-Hoc Agent Deployments in Partially Observed Space (2026)

with E. Meriaux, S. Wen, N. Ndiaye, G. Dudek & A. Loría

To appear in the Proceedings of ALGOWIN, 2026

Robotic Arm Rotation:Standing Up Is Harder Than You Think (2026)

with N. Bousquet, F. Connor, R. El Sabeh, A. Mouawad, N. Nishimura, A. Totschnig

In 20th Scandinavian Symposium on Algorithm Theory (SWAT), 2026

Optimally revealing bits for rejection sampling (2025)

with Alex Waese-Perlman

MIT Undergraduate Research Technology Conference, 2025

Elections in Metric Spaces

We are currently working on finding guarantees on the minimum number of voters we are certain that some candidate gets in any pairwise election. We are interested in the special case of instances where the voters' preferences are induced by a metric space. This generalizes the notion of a Condorcet winner and builds directly on this article.

Approximate core in Participatory Budgeting

We are working on various set ups of participatory budgeting and are trying to find tight guarantees for the existence of core allocations that minimize the restrictions on the given budget. The main case we are considering is where each project has a cost and each agent has a list of approved projects.

The burning number conjecture (2023)

with Gianluca Badiambile & Sergey Norin

Subelliptic operators (2022)

with Suresh Eswarathasan