10 citations · 23 across the 21 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Online Submodular Welfare Maximization: Computation is not the Bottleneck
Rajan Udwani, David Wajc
We revisit the online submodular welfare maximization problem (OSW), a vast generalization of numerous well-studied online allocation problems, including online bipartite matching,…
cs.DS2026
Asymptotically Tight Fractional Online Matching Under Edge Arrivals
David Wajc
In this brief note, we close the asymptotic gap between known upper and lower bounds for fractional online matching under edge arrivals. We prove that the optimal competitive ratio…