Showing cs.DSShow all
2 papers · 1 filter
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.DS2024
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…