Skip to content

Author

Thomas Kesselheim

We have 2 of 118 papers

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 Aug 2026

Online Algorithms via Minimax and Posterior Matching

Competitive analysis is central to the study of online algorithms, but upper bounds are often highly problem-specific. We develop a more unifying methodology via the minimax viewpoint. Guided by Yao's principle, we reduce worst-case competitive analysis to Bayesian online design under an arbitrary correlated prior over...

Thomas Kesselheim, Marco Molinaro, Kalen Patton et al. · 1 citation
Preprint Aug 2026

Online Multi-Agent Contracts

An online variant of the multi-agent contract model that reveals a surprising separation between submodular and XOS rewards: unlike related settings such as offline contract design and prophet inequalities, where constant-factor guarantees for submodular rewards extend to XOS rewards, the online contract setting separa...

Paul Dütting, Michal Feldman, Yoav Gal-Tzur 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.