Manipulation Game Considering No-Regret Strategies

被引:0
|
作者
Clempner, Julio B. [1 ]
机构
[1] Inst Politecn Nacl, Mexico City 07320, Mexico
关键词
Machiavellianism; manipulation; no regret; Markov chains; game theory; STOCK-PRICE MANIPULATION; BAYESIAN PERSUASION; INFORMATION;
D O I
10.3390/math13020184
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper examines manipulation games through the lens of Machiavellianism, a psychological theory. It analyzes manipulation dynamics using principles like hierarchical perspectives, exploitation tactics, and the absence of conventional morals to interpret interpersonal interactions. Manipulators intersperse unethical behavior within their typical conduct, deploying deceptive tactics before resuming a baseline demeanor. The proposed solution leverages Lyapunov theory to establish and maintain Stackelberg equilibria. A Lyapunov-like function supports each asymptotically stable equilibrium, ensuring convergence to a Nash/Lyapunov equilibrium if it exists, inherently favoring no-regret strategies. The existence of an optimal solution is demonstrated via the Weierstrass theorem. The game is modeled as a three-level Stackelberg framework based on Markov chains. At the highest level, manipulators devise strategies that may not sway middle-level manipulated players, who counter with best-reply strategies mirroring the manipulators' moves. Lower-level manipulators adjust their strategies in response to the manipulated players to sustain the manipulation process. This integration of stability analysis and strategic decision-making provides a robust framework for understanding and addressing manipulation in interpersonal contexts. A numerical example focusing on the oil market and its regulations highlights the findings of this work.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning
    Muthukumar, Vidya
    Phade, Soham
    Sahai, Anant
    MATHEMATICS OF OPERATIONS RESEARCH, 2024,
  • [2] No-regret boosting
    Gambin, Anna
    Szczurek, Ewa
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 422 - +
  • [3] No regrets about no-regret
    Chang, Yu-Han
    ARTIFICIAL INTELLIGENCE, 2007, 171 (07) : 434 - 439
  • [4] A general class of no-regret learning algorithms and game-theoretic equilibria
    Greenwald, A
    Jafari, A
    LEARNING THEORY AND KERNEL MACHINES, 2003, 2777 : 2 - 12
  • [5] No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
    Jun-Kun Wang
    Jacob Abernethy
    Kfir Y. Levy
    Mathematical Programming, 2024, 205 : 203 - 268
  • [6] Constrained no-regret learning
    Du, Ye
    Lehrer, Ehud
    JOURNAL OF MATHEMATICAL ECONOMICS, 2020, 88 : 16 - 24
  • [7] Selling to a No-Regret Buyer
    Braverman, Mark
    Mao, Jieming
    Schneider, Jon
    Weinberg, Matt
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 523 - 538
  • [8] No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
    Wang, Jun-Kun
    Abernethy, Jacob
    Levy, Kfir Y.
    MATHEMATICAL PROGRAMMING, 2024, 205 (1-2) : 203 - 268
  • [9] No-regret Reinforcement Learning
    Gopalan, Aditya
    2019 FIFTH INDIAN CONTROL CONFERENCE (ICC), 2019, : 16 - 16
  • [10] Playing against no-regret players
    D'Andrea, Maurizio
    OPERATIONS RESEARCH LETTERS, 2023, 51 (02) : 142 - 145