How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents
Yoav Kolumbus, Noam Nisan
Abstract
The usage of automated learning agents is becoming increasingly prevalent in many online economic applications such as online auctions and automated trading. Motivated by such applications, this paper is dedicated to fundamental modeling and analysis of the strategic situations that the users of automated learning agents are facing. We consider strategic settings where several users engage in a repeated online interaction, assisted by regret-minimizing learning agents that repeatedly play a "game" on their behalf. We propose to view the outcomes of the agents' dynamics as inducing a "meta-game" between the users. Our main focus is on whether users can benefit in this meta-game from "manipulating" their own agents by misreporting their parameters to them. We define a general framework to model and analyze these strategic interactions between users of learning agents for general games and analyze the equilibria induced between the users in three classes of games. We show that, generally, users have incentives to misreport their parameters to their own agents, and that such strategic user behavior can lead to very different outcomes than those anticipated by standard analysis.
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.
Cited by top-tier papers6
- Contracting with a Learning AgentGuru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen et al.NeurIPS 2024 · 38 citations
- Maximizing utility in multi-agent environments by anticipating the behavior of other learnersAngelos Assos, Yuval Dagan, Constantinos DaskalakisNeurIPS 2024 · 16 citations
- Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial SchedulingYoav Kolumbus, Menahem Levy, Noam NisanNeurIPS 2023 · 9 citations
- Is Knowledge Power? On the (Im)possibility of Learning from Strategic InteractionsNivasini Ananthakrishnan, Nika Haghtalab, Chara Podimata, Kunhe YangNeurIPS 2024 · 9 citations
- Strategic Budget Selection in a Competitive Autobidding WorldYiding Feng, Brendan Lucier, Aleksandrs SlivkinsSTOC 2024 · 2 citations
Builds on12
- Near-Optimal No-Regret Learning in General GamesConstantinos Daskalakis, Maxwell Fishelson, Noah GolowichNeurIPS 2021 · 141 citations
- Learning Strategy-Aware Linear ClassifiersYiling Chen, Yang Liu, Chara PodimataNeurIPS 2020 · 110 citations
- Robust Auction Design in the Auto-bidding WorldSantiago R. Balseiro, Yuan Deng, Jieming Mao, Vahab S. Mirrokni et al.NeurIPS 2021 · 95 citations
- Hedging in games: Faster convergence of external and swap regretsXi Chen, Binghui PengNeurIPS 2020 · 88 citations
- Towards Efficient Auctions in an Auto-bidding WorldYuan Deng, Jieming Mao, Vahab S. Mirrokni, Song ZuoWWW 2021 · 87 citations
Related papers
- Auctions between Regret-Minimizing AgentsYoav Kolumbus, Noam NisanWWW 2022 · 47 citations
- Strategic Linear Contextual BanditsThomas Kleine Buening, Aadirupa Saha, Christos Dimitrakakis, Haifeng XuNeurIPS 2024 · 4 citations
- Coordinated Dynamic Bidding in Repeated Second-Price Auctions with BudgetsYurong Chen, Qian Wang, Zhijian Duan, Haoran Sun et al.ICML 2023 · 10 citations
- Randomized Truthful Auctions with Learning AgentsGagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris VelegkasNeurIPS 2024 · 3 citations
- Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement LearningHaozhe Wang, Chao Du, Panyan Fang, Li He et al.KDD 2023 · 6 citations
