1 paper · 1 filter
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 G=(U,V,E), w…