Dynamic resilient network games with applications to multiagent consensus

Yurid Nugraha, Ahmet Cetinkaya, Tomohisa Hayakawa, Hideaki Ishii, Quanyan Zhu

研究成果: Article査読

7 被引用数 (Scopus)

抄録

A cyber security problem in a networked system formulated as a resilient graph problem based on a game-theoretic approach is considered. The connectivity of the underlying graph of the network system is reduced by an attacker who removes some of the edges, whereas the defender attempts to recover them. Both players are subject to energy constraints so that their actions are restricted and cannot be performed continuously. For this two-stage game, we characterize the optimal strategies for the attacker and the defender in terms of edge connectivity and the number of connected components of the graph. The resilient graph game is then applied to a multiagent consensus problem, where the game is played repeatedly over time. In this article, we study how the attacks and the recovery on the edges affect the consensus process. Finally, we also provide numerical simulation to illustrate the results.

本文言語English
論文番号9167396
ページ(範囲)246-259
ページ数14
ジャーナルIEEE Transactions on Control of Network Systems
8
1
DOI
出版ステータスPublished - 2021 3月
外部発表はい

ASJC Scopus subject areas

  • 制御およびシステム工学
  • 信号処理
  • コンピュータ ネットワークおよび通信
  • 制御と最適化

フィンガープリント

「Dynamic resilient network games with applications to multiagent consensus」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル