Online Contract Design With Unknown Technology
Matteo Bollini, Matteo Castiglioni, Alberto Marchesi
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1c179172-671d-46db-ad53-ed20eaa2ec7cBuilds on7
- The Complexity of ContractsPaul Dütting, Tim Roughgarden, Inbal Talgam-CohenSODA 2020 · 26 citations
- Optimal No-Regret Learning for One-Sided Lipschitz FunctionsPaul Duetting, Guru Guruganesh, Jon Schneider, Joshua Ruizhi WangICML 2023 · 22 citations
- Learning Optimal Contracts: How to Exploit Small Action SpacesFrancesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola GattiICLR 2024 · 21 citations
- Delegated ClassificationEden Saig, Inbal Talgam-Cohen, Nir RosenfeldNeurIPS 2023 · 19 citations
- Incentivizing Quality Text Generation via Statistical ContractsEden Saig, Ohad Einav, Inbal Talgam-CohenNeurIPS 2024 · 18 citations
Related papers
- Contract Design Under Approximate Best ResponsesFrancesco Bacchiocchi, Jiarui Gan, Matteo Castiglioni, Alberto Marchesi et al.ICML 2025
- Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent ArrivalsJunyan Liu, Arnab Maiti, Artin Tajdini, Kevin Jamieson et al.ICML 2025
- Contract Design Beyond Hidden-ActionsTomer Ezra, Stefano Leonardi, Matteo RussoSODA 2026 · 4 citations
- 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 et al.NeurIPS 2024 · 38 citations
