Imitative Follower Deception in Stackelberg Games
Not on the map. Why?
Abstract (arXiv)
Information uncertainty is one of the major challenges facing applications of game theory. In the context of Stackelberg games, various approaches have been proposed to deal with the leader's incomplete knowledge about the follower's payoffs, typically by gathering information from the leader's interaction with the follower. Unfortunately, these approaches rely crucially on the assumption that the follower will not strategically exploit this information asymmetry, i.e., the follower behaves truthfully during the interaction according to their actual payoffs. As we show in this paper, the follower may have strong incentives to deceitfully imitate the behavior of a different follower type and, in doing this, benefit significantly from inducing the leader into choosing a highly suboptimal strategy. This raises a fundamental question: how to design a leader strategy in the presence of a deceitful follower? To answer this question, we put forward a basic model of Stackelberg games with (imitative) follower deception and show that the leader is indeed able to reduce the loss due to follower deception with carefully designed policies. We then provide a systematic study of the problem of computing the optimal leader policy and draw a relatively complete picture of the complexity landscape; essentially matching positive and negative complexity results are provided for natural variants of the model. Our intractability results are in sharp contrast to the situation with no deception, where the leader's optimal strategy can be computed in polynomial time, and thus illustrate the intrinsic difficulty of handling follower deception. Through simulations we also examine the benefit of considering follower deception in randomly generated games.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 1; 2024: 2.
9 papers.
- 2021Auctions Between Regret-Minimizing Agentscited by 22
- 2021How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agentscited by 17
- 2024Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactionscited by 5
- 2023Learning to Manipulate a Commitment Optimizercited by 3
- 2022Optimal Private Payoff Manipulation against Commitment in Extensive-form Gamescited by 2
- 2022Commitment with Signaling under Double-sided Information Asymmetrycited by 1
- 2022The Art of Manipulation: Threat of Multi-Step Manipulative Attacks in Security Gamescited by 0
- 2022Mixed Strategies for Security Games with General Defending Requirementscited by 0
- 2024Decentralized Online Learning in General-Sum Stackelberg Gamescited by 0
- 2024Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions15 Aug 2024
- 2024Decentralized Online Learning in General-Sum Stackelberg Games6 May 2024
- 2023Learning to Manipulate a Commitment Optimizer23 Feb 2023
- 2022Commitment with Signaling under Double-sided Information Asymmetry22 Dec 2022
- 2022Optimal Private Payoff Manipulation against Commitment in Extensive-form Games27 Jun 2022
- 2022Mixed Strategies for Security Games with General Defending Requirements26 Apr 2022
- 2022The Art of Manipulation: Threat of Multi-Step Manipulative Attacks in Security Games27 Feb 2022
- 2021How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents14 Dec 2021
- 2021Auctions Between Regret-Minimizing Agents22 Oct 2021