25 citations · 40 across the 14 of their papers we have counts for
5 papers · 1 filter
The Cost of Consistency: Submodular Maximization with Constant Recourse
Paul Dütting, Federico Fusco, Silvio Lattanzi +3
In this work, we study online submodular maximization, and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best…
Selling Joint Ads: A Regret Minimization Perspective
Gagan Aggarwal, Ashwinkumar Badanidiyuru, Paul Dütting +1
Motivated by online retail, we consider the problem of selling one item (e.g., an ad slot) to two non-excludable buyers (say, a merchant and a brand). This problem captures, for ex…
Principal-Agent Reinforcement Learning: Orchestrating AI Agents with Contracts
Dima Ivanov, Paul Dütting, Inbal Talgam-Cohen +2
The increasing deployment of AI is shaping the future landscape of the internet, which is set to become an integrated ecosystem of AI agents. Orchestrating the interaction among AI…
Consistent Submodular Maximization
Paul Dütting, Federico Fusco, Silvio Lattanzi +2
Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper w…
When Contracts Get Complex: Information-Theoretic Barriers
Paul Dütting, Michal Feldman, Yoav Gal-Tzur +1
In the combinatorial-action contract model (Dütting et al., FOCS'21) a principal delegates the execution of a complex project to an agent, who can choose any subset from a given se…