Dynamic spanning tree game with myopic players

被引：0
|
作者：
Guo, Zhao [1 ]
Xu, Huaijinhui [2 ]
Liang, Ying [2 ]
Li, Yin [3 ]
机构：
[1] St Petersburg State Univ, St Petersburg, Russia
[2] Yanan Univ, Yanan, Peoples R China
[3] Harbin Inst Technol, Harbin, Peoples R China
来源：
2023 35TH CHINESE CONTROL AND DECISION CONFERENCE, CCDC | 2023年
关键词：
shock game; spanning tree; myopic strategy; dynamic network game;
D O I：
10.1109/CCDC58219.2023.10326914
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper redefines how players are linked in each stage game based on the dynamic minimum cost spanning tree game with shock. It is demonstrated that in the two-stage minimum cost spanning tree game with shock, the first stage linking path of the players may not be the minimum cost spanning tree. Python is used to run a Monte Carlo simulation to analyze the relationship between the cost of the players link source and whether or not to take a short-sighted approach.
引用
收藏
页码：3183 / 3187
页数：5
相关论文
共 50 条
  • [41] A competition of duopoly game whose players are public: Dynamic investigations
    Askar, S. S.
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2022, 111
  • [42] A competition of duopoly game whose players are public: Dynamic investigations
    Askar, S. S.
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2022, 111
  • [43] A Dynamic Multi-Player Bargaining Game with Veto Players
    Jia Liu
    Xianjia Wang
    Journal of Systems Science and Complexity, 2021, 34 : 673 - 691
  • [44] Optimal equilibria in the non-cooperative game associated with cost spanning tree problems
    Bergantiños, G
    Lorenzo, L
    ANNALS OF OPERATIONS RESEARCH, 2005, 137 (1-4) : 101 - 115
  • [45] Experimental analysis of dynamic minimum spanning tree algorithms (extended abstract)
    Amato, G
    Cattaneo, G
    Italiano, GF
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 314 - 323
  • [46] Distributed Computation and Maintenance of a Spanning Tree in Dynamic Networks by Mobile Agents
    Mouna, Ktari
    Haddar, Mohamed Amine
    Mosbah, Mohamed
    Kacem, Ahmed Hadj
    IEEE 30TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA 2016), 2016, : 331 - 336
  • [47] Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems
    Gustavo Bergantiños
    Leticia Lorenzo
    Annals of Operations Research, 2005, 137 : 101 - 115
  • [48] MAINTENANCE OF A SPANNING TREE FOR DYNAMIC GRAPHS BY MOBILE AGENTS AND LOCAL COMPUTATIONS
    Ktari, Mouna
    Haddar, Mohamed Amine
    Mosbah, Mohamed
    Kacem, Ahmed Hadj
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2017, 51 (02): : 51 - 70
  • [49] Optimization method for reusing GPU data based on dynamic spanning tree
    Dong, X., 1600, Xi'an Jiaotong University (47):
  • [50] Widening the dynamic range of pictures using a minimum spanning tree algorithm
    Orly Yadid-Pecht
    Machine Vision and Applications, 2000, 12 : 1 - 6
12345