Distributional Robustness of Linear Contracts
2026-04-27 • Computer Science and Game Theory
Computer Science and Game Theory
AI summaryⓘ
The authors explore why simple linear contracts are often best even though theory usually suggests complex ones. They study a situation where a boss pays a worker based on uncertain results, but only knows the average outcomes, not all details. They find that linear contracts guarantee the best worst-case payoff for the boss when uncertain about the full outcome distribution. Their work also looks at multiple bosses or workers and shows linear contracts help in those scenarios too. Finally, they identify cases where the math becomes simpler, allowing clearer conclusions.
linear contractsprincipal-agent problemdistributional ambiguityworst-case payoffconcavificationself-inducing actionsaffine contractscommon agencyteam productionrobust optimization
Authors
Shiliang Zuo
Abstract
Linear contracts are ubiquitous in practice, yet optimal contract theory often prescribes complex, nonlinear structures. We provide a distributional robustness justification for linear contracts. We study a principal-agent problem where the agent exerts costly effort across multiple tasks, generating a stochastic signal upon which the principal conditions payment. The principal faces distributional ambiguity: she knows the expected signal for each effort level, but not the full distribution. She seeks a contract maximizing her worst-case payoff over all distributions consistent with this partial knowledge. Our main result shows that linear contracts are optimal for such a principal. For any contract, there exists a linear contract achieving weakly higher worst-case payoff. The proof introduces the concavification approach built around the notion of self-inducing actions; these are actions where an affine contract simultaneously induces the action as optimal and supports the concave envelope of payments from above. We show that self-inducing actions always exist as maximizers of the gap between the concave envelope and agent's cost function. We extend these results to multi-party settings. In common agency with multiple principals, we show that affine contracts improve all principals' worst-case payoffs. In team production with multiple agents, we establish a complementary necessity result: if any agent's contract is non-affine, the unique ex-post robust equilibrium is zero effort. Finally, we show that homogeneous utility and cost functions yield tractable characterizations, enabling closed-form approximation ratios and a sharp boundary between computational tractability results.