.png){kind=icon}
返回
A Reset Algorithm Solving Coordination With Antagonistic Reciprocity
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3049149.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article is dedicated to solving the coordination problem using a reset algorithm that consists of linear impulsive dynamics, over which antagonistic reciprocity among interacting individuals is inevitable. It shows that reciprocal agents are convergent (including consensus and clusters) whenever the scaling parameters of an agent, corresponded to continuous/discrete dynamics, enjoy the same proportion value that matches to all agents. Otherwise, all participating agents share nothing eventually, that is, they achieve stability. This immediately gives rise to that the final aggregated values of agents are entirely determined by the underlying parameters, on condition that the connection property of communication topologies is preserved. Therefore, the proposed setup features a unified perspective on consensus, clusters (including bipartite consensus), and stability that are separately studied in most of the existing literature. The developed method is well supported via numerical examples.
Keyword:
Mathematical model
Heuristic algorithms
Numerical stability
Laplace equations
Topology
Stability criteria
Social networking (online)
Antagonistic reciprocity
consensus
clusters
reset algorithm
stability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏Edge-Based Finite-Time Protocol Analysis With Final Consensus Value and Settling Time Estimations
OAAI
OAAI分享收藏
查看更多内容