1 citations · 2 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Online Multi-Agent Contracts
Paul Dütting, Michal Feldman, Yoav Gal-Tzur +1
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…
cs.DS2026
Graphic Matroid Secretary without the Graph
Paul Dütting, Renato Paes Leme, Martin Pál +1
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 consta…