Hiring for An Uncertain Task: Joint Design of Information and Contracts
Matteo Castiglioni, Junjie Chen
摘要
Information design and contract design are two important topics in microeconomics. In a principalagent model, information design concerns the information asymmetry between two players, while contract design addresses the moral hazard challenge. Though they are typically studied as two disjoint problems, in many real-world scenarios, e.g., recruitment, information asymmetry and moral hazard could appear simultaneously.
In this paper, we initiate the computational problem of jointly designing information and contracts. We consider three possible classes of contracts with decreasing flexibility and increasing simplicity: ambiguous contracts, menus of explicit contracts and explicit single contract. Ambiguous contracts allow the principal to conceal the applied payment schemes through a contract that depends on the unknown state of nature, while explicit contracts reveal the contract prior to the agent's decision. Our results show a trade-off between the simplicity of the contracts and the computational complexity of the joint design. Indeed, we show that an approximately-optimal mechanism with ambiguous contracts can be computed in polynomial time. However, they are convoluted mechanisms and not well-suited for some real-world scenarios. Conversely, explicit menus of contracts and single contracts are simpler mechanisms, but they cannot be computed efficiently. In particular, we show that computing the optimal mechanism with explicit menus of contracts and single contracts is APX-Hard. We also characterize the structure of optimal mechanisms. Interestingly, direct mechanisms are optimal for both the most flexible ambiguous contracts and the least flexible explicit single contract, but they are suboptimal for that with menus of contracts. Finally, motivated by our hardness results, we turn our attention to menus of linear contracts and single linear contracts. We show that both the problem of computing the optimal mechanism with an explicit menu of linear contracts and an explicit single linear contract admits an FPTAS. * Authors are listed in α-β order. † Work was done while Junjie Chen was a visiting student at Osaka University.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Adaptive Contracts for Cost-Effective AI DelegationEden Saig, Tamar Garbuz, Ariel Procaccia, Inbal Talgam-Cohen 等ICML 2026 · 被引用 2 次
- When Contracts Get Complex: Information-Theoretic BarriersPaul Dütting, Michal Feldman, Yoav Gal Tzur, Aviad RubinsteinSODA 2026
它引用的顶会 Paper13
- Selling Data To a Machine Learner: Pricing via Costly SignalingJunjie Chen, Minming Li, Haifeng XuICML 2022 · 被引用 32 次
- The Complexity of ContractsPaul Dütting, Tim Roughgarden, Inbal Talgam-CohenSODA 2020 · 被引用 26 次
- On the Tractability of Public Persuasion with No ExternalitiesHaifeng XuSODA 2020 · 被引用 22 次
- Optimal No-Regret Learning for One-Sided Lipschitz FunctionsPaul Duetting, Guru Guruganesh, Jon Schneider, Joshua Ruizhi WangICML 2023 · 被引用 22 次
- Learning Optimal Contracts: How to Exploit Small Action SpacesFrancesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola GattiICLR 2024 · 被引用 21 次
相关 Paper
- A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract DesignMatteo Castiglioni, Junjie Chen, Minming Li, Haifeng Xu 等SODA 2025 · 被引用 5 次
- Learning in Online Principal-Agent Interactions: The Power of MenusMinbiao Han, Michael Albert, Haifeng XuAAAI 2024 · 被引用 9 次
- Online Information Acquisition: Hiring Multiple AgentsFederico Cacciamani, Matteo Castiglioni, Nicola GattiICLR 2024 · 被引用 3 次
- On Supermodular Contracts and Dense SubgraphsRamiro Deo-Campo Vuong, Shaddin Dughmi, Neel Patel, Aditya PrasadSODA 2024 · 被引用 8 次
- Automated Mechanism Design for Classification with Partial VerificationHanrui Zhang, Yu Cheng, Vincent ConitzerAAAI 2021 · 被引用 13 次
