259 citations
- Centre de Recherche en Économie et StatistiqueFR18 papers
- Centre Inria de SaclayFR16 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Sorbonne UniversitéFR14 papers
- Laboratoire d'Informatique de GrenobleFR12 papers
- École Normale Supérieure Paris-SaclayFR11 papers
- ENSAE ParisFR11 papers
- École Nationale d'AdministrationSN9 papers
- Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR8 papers
- École PolytechniqueFR7 papers
- Institut Systèmes Intelligents et de RobotiqueFR7 papers
- POLARIS: Évaluation et optimisation des performances des grandes infrastructuresFR6 papers
5 papers · 1 filter
Online matching on stochastic block model
Maria Cherifa, Clément Calauzènes, Vianney Perchet
While online bipartite matching has gained significant attention in recent years, existing analyses in stochastic settings fail to capture the performance of algorithms on heteroge…
On Tradeoffs in Learning-Augmented Algorithms
Ziyad Benomar, Vianney Perchet
The field of learning-augmented algorithms has gained significant attention in recent years. These algorithms, using potentially inaccurate predictions, must exhibit three key prop…
Lookback Prophet Inequalities
Ziyad Benomar, Dorian Baudry, Vianney Perchet
Prophet inequalities are fundamental optimal stopping problems, where a decision-maker observes sequentially items with values sampled independently from known distributions, and m…
Dynamic online matching with budget refills
Maria Cherifa, Clément Calauzènes, Vianney Perchet
Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph , w…
Online Matching in Geometric Random Graphs
Flore Sentenac, Nathan Noiry, Matthieu Lerasle +2
We investigate online maximum cardinality matching, a central problem in ad allocation. In this problem, users are revealed sequentially, and each new user can be paired with any p…