Author

Paul Dütting

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

Graphic Matroid Secretary without the Graph

The matroid secretary problem (MSP) is one of the cleanest, and most captivating open problems in online algorithms. The famous MSP conjecture stipulates that there exists a constant-competitive algorithm, yet to date the best known algorithms are $O(\log \log (\text{rank}))$ competitive. It is widely believed that all...

Paul Dütting, R. P. Leme, Martin Pál et al. · 5 citations

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