Efficient Algorithms for Online Subadditive Combinatorial Allocations
For the online combinatorial allocation problem with subadditive valuations, Correa and Cristi (STOC 2023) proved the existence of a $6$-competitive online algorithm, improving on the previous best $O(\log\!\log m)$-competitive online algorithm due to D\"utting, Kesselheim, and Lucier (FOCS 2020), where $m$ is the numb...