Learning in Online Principal-Agent Interactions: The Power of Menus
Minbiao Han, Michael Albert, Haifeng Xu
Abstract
We study a ubiquitous learning challenge in online principalagent problems during which the principal learns the agent's private information from the agent's revealed preferences in historical interactions. This paradigm includes important special cases such as pricing and contract design, which have been widely studied in recent literature. However, existing work considers the case where the principal can only choose a single strategy at every round to interact with the agent and then observe the agent's revealed preference through their actions. In this paper, we extend this line of study to allow the principal to offer a menu of strategies to the agent and learn additionally from observing the agent's selection from the menu. We provide a thorough investigation of several online principal-agent problem settings and characterize their sample complexities, accompanied by the corresponding algorithms we have developed. We instantiate this paradigm to several important design problems -including Stackelberg (security) games, contract design, and information design. Finally, we also explore the connection between our findings and existing results about online learning in Stackelberg games, and we offer a solution that can overcome a key hard instance of Peng et al. (2019) .
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 dbd59a52-1d85-4ddf-ac62-2d6db71e0a1bCited by top-tier papers5
- Contracting with a Learning AgentGuru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen et al.NeurIPS 2024 · 38 citations
- Impact of Decentralized Learning on Player Utilities in Stackelberg GamesKate Donahue, Nicole Immorlica, Meena Jagadeesan, Brendan Lucier et al.ICML 2024 · 9 citations
- Online Contract Design With Unknown TechnologyMatteo Bollini, Matteo Castiglioni, Alberto MarchesiICML 2026
- Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information AcquisitionZichen Wang, Chuanhao Li, Huazheng WangICML 2025
- Contextual Search in Principal-Agent Games: The Curse of DegeneracyYiding Feng, Mengfan Ma, Bo Peng, Zongqi WanSODA 2026
Builds on5
- Online Bayesian PersuasionMatteo Castiglioni, Andrea Celli, Alberto Marchesi, Nicola GattiNeurIPS 2020 · 26 citations
- Online Learning in Stackelberg Games with an Omniscient FollowerGeng Zhao, Banghua Zhu, Jiantao Jiao, Michael I. JordanICML 2023 · 23 citations
- Learning to Incentivize Information Acquisition: Proper Scoring Rules Meet Principal-Agent ModelSiyu Chen, Jibang Wu, Yifan Wu, Zhuoran YangICML 2023 · 9 citations
- The Limits of Optimal Pricing in the DarkQuinlan Dawkins, Minbiao Han, Haifeng XuNeurIPS 2021 · 6 citations
- First-Order Convex Fitting and Its Application to Economics and OptimizationQuinlan Dawkins, Minbiao Han, Haifeng XuAAAI 2022 · 4 citations
Related papers
- Learning Optimal Contracts: How to Exploit Small Action SpacesFrancesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi, Nicola GattiICLR 2024 · 21 citations
- Contract Design Under Approximate Best ResponsesFrancesco Bacchiocchi, Jiarui Gan, Matteo Castiglioni, Alberto Marchesi et al.ICML 2025
- Generalized Principal-Agent Problem with a Learning AgentTao Lin, Yiling ChenICLR 2025
- Nearly-Optimal Bandit Learning in Stackelberg Games with Side InformationNina Balcan, Martino Bernasconi, Matteo Castiglioni, Andrea Celli et al.ICLR 2026 · 9 citations
- Regret Analysis of Repeated Delegated ChoiceMohammad Hajiaghayi, Mohammad Mahdavi, Keivan Rezaei, Suho ShinAAAI 2024 · 8 citations
