Scholarlink

<p>We explore the problem of combinatorial contract design, a subject introduced and studied by Dütting et al. (2023). Previous research has focused on the challenge of selecting an unconstrained subset of agents, particularly when the principal’s utility function exhibits XOS or submodular characteristics related to the subset of agents that exert effort. Our study extends this existing line of research by examining scenarios in which the principal aims to select a subset of agents with a specific <i>k</i>-cardinality constraint. In these scenarios, the actions that each agent can take are binary values: effort or no effort. We focus on linear contracts, where the expected reward function is XOS or submodular. Our contribution is an approximation of 0.0197 for the problem of designing multi-agent hidden-action principal-agent contracts with the <i>k</i>-cardinality constraint. This result stands in contrast to the unconstrained setting, where Dütting et al. (2023) achieved an approximation of nearly 0.0039.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Approximating combinatorial contracts with a cardinality constraint

  • 期刊论文

  • 发表日期：

    2025年5月21日

查看全文
  • Qinqin Gong,
  • Ling Gai,
  • Yanjun Jiang,
  • Yang Lv,
  • Ruiqi Yang

摘要

We explore the problem of combinatorial contract design, a subject introduced and studied by Dütting et al. (2023). Previous research has focused on the challenge of selecting an unconstrained subset of agents, particularly when the principal’s utility function exhibits XOS or submodular characteristics related to the subset of agents that exert effort. Our study extends this existing line of research by examining scenarios in which the principal aims to select a subset of agents with a specific k-cardinality constraint. In these scenarios, the actions that each agent can take are binary values: effort or no effort. We focus on linear contracts, where the expected reward function is XOS or submodular. Our contribution is an approximation of 0.0197 for the problem of designing multi-agent hidden-action principal-agent contracts with the k-cardinality constraint. This result stands in contrast to the unconstrained setting, where Dütting et al. (2023) achieved an approximation of nearly 0.0039.