Learning in Stackelberg Games with Non-myopic Agents
ACM Conference on Economics and Computation (EC), 2022

Main:24 Pages
9 Figures
Bibliography:6 Pages
1 Tables
Appendix:27 Pages
Abstract
We study Stackelberg games where a principal repeatedly interacts with a non-myopic long-lived agent, without knowing the agent's payoff function. Although learning in Stackelberg games is well-understood when the agent is myopic, dealing with non-myopic agents poses additional complications. In particular, non-myopic agents may strategize and select actions that are inferior in the present in order to mislead the principal's learning algorithm and obtain better outcomes in the future.
View on arXivComments on this paper
