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 条
  • [21] Limits and limitations of no-regret learning in games
    Monnot, Barnabe
    Piliouras, Georgios
    KNOWLEDGE ENGINEERING REVIEW, 2017, 32
  • [22] An α-No-Regret Algorithm For Graphical Bilinear Bandits
    Rizk, Geovani
    Colin, Igor
    Thomas, Albert
    Laraki, Rida
    Chevaleyre, Yann
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [23] Optimistic No-regret Algorithms for Discrete Caching
    Mhaisen N.
    Sinha A.
    Paschos G.
    Iosifidis G.
    Performance Evaluation Review, 2023, 51 (01): : 69 - 70
  • [24] Optimistic No-regret Algorithms for Discrete Caching
    Mhaisen, Naram
    Sinha, Abhishek
    Paschos, Georgios
    Iosifidis, George
    PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS, 2022, 6 (03)
  • [25] On the convergence of no-regret learning in selfish routing
    Krichene, Walid
    Drighes, Benjamin
    Bayen, Alexandre
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 2), 2014, 32 : 163 - 171
  • [26] No-Regret Learning in Dynamic Stackelberg Games
    Lauffer, Niklas
    Ghasemi, Mahsa
    Hashemi, Abolfazl
    Savas, Yagiz
    Topcu, Ufuk
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (03) : 1418 - 1431
  • [27] Acceleration through Optimistic No-Regret Dynamics
    Wang, Jun-Kun
    Abernethy, Jacob
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [28] Unifying convergence and no-regret in multiagent learning
    Banerjee, Bikramjit
    Peng, Jing
    LEARNING AND ADAPTION IN MULTI-AGENT SYSTEMS, 2006, 3898 : 100 - 114
  • [29] Calibration and Internal No-Regret with Random Signals
    Perchet, Vianney
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2009, 5809 : 68 - 82
  • [30] No-regret Algorithms for Fair Resource Allocation
    Sinha, Abhishek
    Joshi, Ativ
    Bhattacharjee, Rajarshi
    Musco, Cameron
    Hajiesmaili, Mohammad
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,