English
Related papers

Related papers: Linear Contracts for Supermodular Functions Based …

200 papers

We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the problem when the principal's utility function is submodular…

Computer Science and Game Theory · Computer Science 2023-08-16 Ramiro Deo-Campo Vuong , Shaddin Dughmi , Neel Patel , Aditya Prasad

In the combinatorial-action contract model (D\"utting et al., FOCS'21) a principal delegates the execution of a complex project to an agent, who can choose any subset from a given set of actions. Each set of actions incurs a cost to the…

Computer Science and Game Theory · Computer Science 2025-11-27 Paul Dütting , Michal Feldman , Yoav Gal-Tzur , Aviad Rubinstein

We introduce a new model of combinatorial contracts in which a principal delegates the execution of a costly task to an agent. To complete the task, the agent can take any subset of a given set of unobservable actions, each of which has an…

Computer Science and Game Theory · Computer Science 2025-09-03 Paul Duetting , Tomer Ezra , Michal Feldman , Thomas Kesselheim

We introduce a novel model of contracts with combinatorial actions that accounts for sequential and adaptive agent behavior. As in the standard model, a principal delegates the execution of a costly project to an agent. There are $n$…

Computer Science and Game Theory · Computer Science 2025-04-22 Tomer Ezra , Michal Feldman , Maya Schlesinger

In this work, we study sequential contracts under matroid constraints. In the sequential setting, an agent can take actions one by one. After each action, the agent observes the stochastic value of the action and then decides which action…

Computer Science and Game Theory · Computer Science 2026-02-04 Kanstantsin Pashkovich , Jacob Skitsko , Yun Xing

We study a natural combinatorial single-principal multi-agent contract design problem, in which a principal motivates a team of agents to exert effort toward a given task. At the heart of our model is a reward function, which maps the agent…

Computer Science and Game Theory · Computer Science 2026-03-04 Paul Duetting , Tomer Ezra , Michal Feldman , Thomas Kesselheim

We study the combinatorial contracting problem of D\"utting et al. [FOCS '21], in which a principal seeks to incentivize an agent to take a set of costly actions. In their model, there is a binary outcome (the agent can succeed or fail),…

Computer Science and Game Theory · Computer Science 2023-09-20 Paul Dütting , Michal Feldman , Yoav Gal Tzur

We study hidden-action principal-agent problems with multiple agents. These are problems in which a principal commits to an outcome-dependent payment scheme in order to incentivize some agents to take costly, unobservable actions that lead…

Computer Science and Game Theory · Computer Science 2023-02-01 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper we study natural combinatorial contract settings involving…

Computer Science and Game Theory · Computer Science 2024-05-15 Paul Duetting , Tomer Ezra , Michal Feldman , Thomas Kesselheim

A principal selects a team of agents for collaborating on a joint project. The principal aims to design a revenue-optimal contract that incentivize the team of agents to exert costly effort while satisfying fairness constraints. We show…

Computer Science and Game Theory · Computer Science 2025-12-23 Matteo Castiglioni , Junjie Chen , Yingkai Li

We study a new class of contract design problems where a principal delegates the execution of multiple projects to a set of agents. The principal's expected reward from each project is a combinatorial function of the agents working on it.…

Computer Science and Game Theory · Computer Science 2025-06-09 Tal Alon , Matteo Castiglioni , Junjie Chen , Tomer Ezra , Yingkai Li , Inbal Talgam-Cohen

We consider the classic principal-agent model of contract theory, in which a principal designs an outcome-dependent compensation scheme to incentivize an agent to take a costly and unobservable action. When all of the model…

Computer Science and Game Theory · Computer Science 2020-08-11 Paul Dütting , Tim Roughgarden , Inbal Talgam-Cohen

We study multi-agent contract design with combinatorial actions, under budget constraints, and for a broad class of objective functions, including profit (principal's utility), reward, and welfare. Our first result is a strong…

Computer Science and Game Theory · Computer Science 2025-11-26 Michal Feldman , Yoav Gal-Tzur , Tomasz Ponitka , Maya Schlesinger

We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme (a.k.a. contract) so as to induce an agent to take a costly, unobservable action. We relax the assumption that the principal perfectly…

Computer Science and Game Theory · Computer Science 2021-06-02 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

In the combinatorial action model of contract design, a principal delegates a complex project to an agent, incentivizing a subset of actions from a ground set of $n$ actions, via a linear contract. Computing the optimal contract is a…

Computer Science and Game Theory · Computer Science 2026-04-17 Elizabeth Baldwin , Paul Duetting , Michal Feldman , Maya Schlesinger

We study the optimal contract problem in the \emph{combinatorial actions} framework of D\"utting et al.~[FOCS'21], where a principal delegates a project to an agent who chooses a subset of hidden, costly actions, and the resulting reward is…

Computer Science and Game Theory · Computer Science 2026-03-17 Michal Feldman , Liat Yashin

In the classical principal-agent hidden-action contract model, a principal delegates the execution of a costly task to an agent. In order to complete the task, the agent chooses an action from a set of actions, where each potential action…

Computer Science and Game Theory · Computer Science 2025-11-27 Tomer Ezra , Stefano Leonardi , Matteo Russo

We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible contracts---known in economics…

Data Structures and Algorithms · Computer Science 2020-02-28 Paul Duetting , Tim Roughgarden , Inbal Talgam-Cohen

We study a principal-agent team production model. The principal hires a team of agents to participate in a common production task. The exact effort of each agent is unobservable and unverifiable, but the total production outcome (e.g. the…

Computer Science and Game Theory · Computer Science 2025-05-27 Shiliang Zuo

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…

Computer Science and Game Theory · Computer Science 2026-04-28 Shiliang Zuo
‹ Prev 1 2 3 10 Next ›