3 papers
cs.DS2025
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…
cs.DS2025
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…
cs.LG2025
Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
We consider the classical multi-armed bandit problem, but with strategic arms. In this context, each arm is characterized by a bounded support reward distribution and strategically…