Mathieu Molina
I am a postdoctoral fellow at Tel Aviv University, working with Michal Feldman.
My main research interests are in online algorithms and decision-making under uncertainty. I am interested in understanding how limited information, stochastic structure, and constraints affect what algorithms can achieve, and in developing refined guarantees for these problems.
More broadly, my research lies in Economics and Computations and applied mathematics, and draws on ideas from computational complexity, continuous optimization, probability, learning, and mechanism design. I am particularly interested in problems where several of these perspectives interact, including resource allocation, prophet inequalities, combinatorial optimization, and algorithmic game theory.
I completed my PhD in Applied Mathematics in September 2025 at Inria FAIRPLAY and CREST, ENSAE, advised by Patrick Loiseau, Vianney Perchet, and Nicolas Gast. My thesis, The Impact of Fairness in Resource Allocation, studies how fairness changes the design and performance of algorithms and mechanisms for resource allocation.
Before that, I graduated from Mines Paris and completed the Master’s in Artificial Intelligence, Systems, Data at PSL University.
Publications
You can also find my articles on Google Scholar.
Optimal Online Stochastic Matching
Preprint 2026 · Paper
Preprint 2026 · Paper
Kernel Methods for Refined Prophet Inequalities
Preprint 2026 · Paper
Tight L∞ Sample Complexity for Low-Degree and Sparse Boolean Polynomials
NeurIPS 2026 · Paper
Prophet Inequalities under Local Differential Privacy
EC 2026 · Paper
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
Preprint 2026 · Paper
Prophet Inequalities: Competing with the Top ℓ Items is Easy
SODA 2025 · Paper
The Price of Opportunity Fairness in Matroid Allocation Problems
NeurIPS 2025 · Paper
EC 2025 · Paper · best poster at GAIMSS 24
Multi-Armed Bandits with Guaranteed Revenue per Arm
AISTATS 2024 · Paper
Trading-off price for data quality to achieve fair online allocation
NeurIPS 2023 · Paper · best poster at Hi! PARIS summer school 2024
On Preemption and Learning in Stochastic Scheduling
ICML 2023 · Paper
Bounding and Approximating Intersectional Fairness through Marginal Fairness
NeurIPS 2022 · Paper
Academic service
Program committees: ITCS 2027, EC 2026.
Reviewing (selected): NeurIPS, STOC, FOCS, SODA, ICALP; Mathematics of Operations Research, International Journal of Game Theory.
