Skip to content

Author

Kanstantsin Pashkovich

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

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...

Calum MacRury, Rian Neogi, Kanstantsin Pashkovich et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.