Fetching the paper…
Reading the bibliography…
We study the combinatorial contracting problem of D\"utting et al.
Mathematical techniques for efficient record segmentation in large shared databases
Mark J Eisner and Dennis G Severance · 1976
Earlier work this paper cites.
Combinatorial optimization with rational objective functions
Nimrod Megiddo · 1978
Earlier work this paper cites.
Moral hazard and observability
Bengt Holmström · 1979
Earlier work this paper cites.
Sensitivity analysis for combinatorial optimization
Daniel Mier Gusfield · 1980
Earlier work this paper cites.
Parametric shortest path algorithms with an application to cyclic staffing
Richard M Karp and James B Orlin · 1981
Earlier work this paper cites.
Complexity of some parametric integer and network programming problems
Patricia J Carstensen · 1983
Earlier work this paper cites.
Multitask principal–agent analyses: Incentive contracts, asset ownership, and job design
Bengt Holmstrom and Paul Milgrom · 1991
Earlier work this paper cites.
An analysis of the principal-agent problem
Sanford J Grossman and Oliver D Hart · 1992
Earlier work this paper cites.
A lower bound for the shortest path problem
Ketan Mulmuley and Pradyut Shah · 2000
Earlier work this paper cites.
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Satoru Iwata, Lisa Fleischer, and Satoru Fujishige · 2001
Earlier work this paper cites.
Combinatorial auctions with decreasing marginal utilities
Benny Lehmann, Daniel Lehmann, and Noam Nisan · 2001
Earlier work this paper cites.
A fully combinatorial algorithm for submodular function minimization
Satoru Iwata · 2002
Earlier work this paper cites.
A faster scaling algorithm for minimizing submodular functions
Satoru Iwata · 2003
Earlier work this paper cites.
Substitutes Valuations and m-concavity
A. Bertelsen · 2005
Cited alongside, same era.
Combinatorial agency
Moshe Babaioff, Michal Feldman, and Noam Nisan · 2006
Cited alongside, same era.
Mixed strategies in combinatorial agency
Moshe Babaioff, Michal Feldman, and Noam Nisan · 2006
Cited alongside, same era.
A strongly polynomial algorithm for line search in submodular polyhedra
Kiyohito Nagano · 2007
Cited alongside, same era.
Free-riding and free-labor in combinatorial agency
Moshe Babaioff, Michal Feldman, and Noam Nisan · 2009
Cited alongside, same era.
Enumerative combinatorics volume 1 second edition
Richard P Stanley · 2011
Cited alongside, same era.
Bayesian agency: Linear versus tractable contracts
Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2021
Later among the works it cites.
The complexity of contracts
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen · 2021
Later among the works it cites.
Contracts under moral hazard and adverse selection
Guru Guruganesh, Jon Schneider, and Joshua R Wang · 2021
Later among the works it cites.
Designing menus of contracts efficiently: the power of randomization
Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2022
Later among the works it cites.
Combinatorial contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim · 2022
Later among the works it cites.
Bayesian analysis of linear contracts
Tal Alon, Paul Duetting, Yingkai Li, and Inbal Talgam-Cohen · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Chien-Ju Ho, Aleksandrs Slivkins, and Jennifer Wortman Vaughan · 2014
Cited alongside, same era.
Robustness and linear contracts
Gabriel Carroll · 2015
Cited alongside, same era.
Gross substitutability: An algorithmic survey
Renato Paes Leme · 2017
Cited alongside, same era.
Delegated search approximates efficient search
Jon Kleinberg and Robert Kleinberg · 2018
Cited alongside, same era.
Simple versus optimal contracts
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen · 2019
Cited alongside, same era.
How do classifiers induce agents to invest effort strategically?
Jon Kleinberg and Manish Raghavan · 2020
Cited alongside, same era.
Multi-agent contract design: How to commission multiple agents with individual outcomes
Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2023
Closest in time.
Multi-agent contracts
Paul Dütting, Tomer Ezra, Michal Feldman, and Thomas Kesselheim · 2023
Closest in time.
Optimal no-regret learning for one-side lipschitz functions
Paul Dütting, Guru Guruganesh, Jon Schneider, and Joshua Wang · 2023
Closest in time.
The power of menus in contract design
Guru Guruganesh, Jon Schneider, Joshua R. Wang, and Junyao Zhao · 2023
Closest in time.
On supermodular contracts and dense subgraphs
Ramiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, and Aditya Prasad · 2023
Closest in time.
The sample complexity of online contract design
Banghua Zhu, Stephen Bates, Zhuoran Yang, Yixin Wang, Jiantao Jiao, and Michael I. Jordan · 2023
Closest in time.