Efficient Algorithms for Online Subadditive Combinatorial Allocations

Calum MacRury, Rian Neogi, Kanstantsin Pashkovich +4

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…