Skip to content

Author

David Wajc

2 papers 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

Online Submodular Welfare Maximization: Computation is not the Bottleneck

We revisit the online submodular welfare maximization problem (OSW), a vast generalization of numerous well-studied online allocation problems, including online bipartite matching, display ads and AdWords. A natural greedy OSW algorithm achieves a competitive ratio of $1/2$ [LLN06], and $1-1/e$ under i.i.d. arrivals [K...

Rajan Udwani, David Wajc · 3 citations · ⚡2
Preprint Aug 2026

Asymptotically Tight Fractional Online Matching Under Edge Arrivals

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 for this problem is $1/2+\Theta(1/n)$. The algorithm was suggested and analyzed by OpenAI's ChatGPT Sol based on a single prompt. The prese...

David Wajc · 0 citations

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