Learning in Online Principal-Agent Interactions: The Power of Menus
Not on the map. Why?
Abstract (arXiv)
We study a ubiquitous learning challenge in online principal-agent 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).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 9 of its 43 references that are in the map. First posted on arXiv 15 Dec 2023.
Builds on
9 of 43 references.
References · 9
- 2018The Social Cost of Strategic Classificationcited by 105
- 2022The Sample Complexity of Online Contract Designcited by 35
- 2018Simple versus Optimal Contractscited by 33
- 2022Learning in Stackelberg Games with Non-myopic Agentscited by 29
- 2016Algorithmic Persuasion with No Externalitiescited by 9
- 2014Learning Economic Parameters from Revealed Preferencescited by 8
- 2023The Power of Menus in Contract Designcited by 5
- 2023Algorithmic Persuasion Through Simulationcited by 4
- 2021The Limits of Optimal Pricing in the Darkcited by 3
Built on by
Citing papers per year: 2024: 3; 2025: 1.
4 papers.
- 2024Contracting with a Learning Agentcited by 23
- 2024Impact of Decentralized Learning on Player Utilities in Stackelberg Gamescited by 5
- 2024No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processescited by 3
- 2025Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisitioncited by 0
- 2025Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition23 May 2025
- 2024No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes14 May 2024
- 2024Impact of Decentralized Learning on Player Utilities in Stackelberg Games29 Feb 2024
- 2024Contracting with a Learning Agent29 Jan 2024