The Complexity of Continuous Contract Design over PolymatroidsResearch Paper
In a principal–agent problem, a principal delegates work to an agent whose effort is not observed and pays the agent according to the outcome. Linear contracts, which pay the agent a fixed share of the reward, are the simplest and most widely used class; for binary outcomes they are without loss of generality. Algorithmic contract theory asks when…