24 citations · 57 across the 43 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020★ 2 cited
The Complexity of Contracts
Paul Duetting, Tim Roughgarden, Inbal Talgam-Cohen
We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff o…
cs.DS2016
Approximate Modularity Revisited
Uriel Feige, Michal Feldman, Inbal Talgam-Cohen
Set functions with convenient properties (such as submodularity) appear in application areas of current interest, such as algorithmic game theory, and allow for improved optimizati…
cs.DS2010★ 24 cited
Vertex Sparsifiers: New Results from Old Techniques
Matthias Englert, Anupam Gupta, Robert Krauthgamer +3
Given a capacitated graph and a set of terminals , how should we produce a graph only on the terminals so that every (multicommodity) flow betwee…