Author

Thomas Kesselheim

h-index 24 View on Semantic Scholar

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

We introduce and study an online variant of the multi-agent contract model. In our model, agents arrive one-by-one and are active with a certain probability. Upon arrival of agent $i$, the principal offers a linear contract $\alpha_i$, specifying the fraction of the principal's reward transferred to agent $i$. Agents c...

Paul Dütting, Michal Feldman, Yoav Gal-Tzur et al. · 0 citations