Online Contract Design With Unknown Technology
Matteo Bollini, Matteo Castiglioni, Alberto Marchesi
摘要
Hidden-action principal-agent problems model scenarios in which a principal induces an agent to take a costly and unobservable action through the provision of outcome-dependent payments. These problems find application in a variety of real-world settings, such as crowdsourcing, online labor platforms, and machine learning task delegation. Recently, much of the literature has focused on how to handle the principal’s uncertainty about the agent and the surrounding environment, which is often the main challenge in practice. One prominent approach is to adopt an online learning framework, where the principal repeatedly interacts with the agent to learn optimal payments from experience. However, existing learning algorithms, while achieving regret that scales sublinearly in the number of interaction rounds , typically suffer from an exponential dependence on the size of the problem instance. In this paper, we show that this problematic exponential growth can be avoided by assuming that the principal has knowledge of a set of possible actions of the agent, while remaining unaware of which actions are actually available---an assumption that is reasonable in many real-world settings.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper7
- The Complexity of ContractsPaul Dütting, Tim Roughgarden, Inbal Talgam-CohenSODA 2020 · 被引用 26 次
- 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 次
- Delegated ClassificationEden Saig, Inbal Talgam-Cohen, Nir RosenfeldNeurIPS 2023 · 被引用 19 次
- Incentivizing Quality Text Generation via Statistical ContractsEden Saig, Ohad Einav, Inbal Talgam-CohenNeurIPS 2024 · 被引用 18 次
相关 Paper
- Contract Design Under Approximate Best ResponsesFrancesco Bacchiocchi, Jiarui Gan, Matteo Castiglioni, Alberto Marchesi 等ICML 2025
- Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent ArrivalsJunyan Liu, Arnab Maiti, Artin Tajdini, Kevin Jamieson 等ICML 2025
- Contract Design Beyond Hidden-ActionsTomer Ezra, Stefano Leonardi, Matteo RussoSODA 2026 · 被引用 4 次
- Stochastic Principal-Agent Problems: Computing and Learning Optimal History-Dependent PoliciesJiarui Gan, Rupak Majumdar, Debmalya Mandal, Goran RadanovicNeurIPS 2025
- Contracting with a Learning AgentGuru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen 等NeurIPS 2024 · 被引用 38 次
