Rolling Horizon Games for Cluster Formation of Resilient Multiagent Systems

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

doi:10.1109/cdc45484.2021.9683409

Cited by 2 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, if the defender allocates its resources to the edges that are not attacked, the resources will also be wasted without any improvement of the network connectivity. While the recent works [3], [5], [8] consider jamming in similar multiagent system settings, the notion of wasted resources does not appear there.…”

Section: Problem Formulationmentioning

confidence: 99%

“…Since the non-uniform game periods make the players decide their strategies at different times, we use different decision-making indices l A and l D to specify the decisionmaking processes that occur at times (l A − 1)T A and (l D − 1)T D for the attacker and the defender, respectively, where the players maximize the utility functions (7) and (8). Note that different values of these indices for the players may refer to the same time step; e.g., in Fig.…”

Section: B Non-uniform Game Periodsmentioning

confidence: 99%

“…From the utility function in (8), given that b = 0, we can see that the defender obtains a higher utility if the agents are closer, which means that given a nonzero number of edges to recover (at the first step of the games with index l D i described above), the defender recovers the edges connecting further agents. Specifically, for the sequence of decision-making indices [l…”

Section: Consensus Analysismentioning

confidence: 99%

“…The players are assumed to have different computational abilities, represented by the non-uniform values of the horizon lengths and the game periods. This problem can be viewed as an extension of our previous studies [8], [9]; we considered the special case with players' uniform horizon parameters in [8], whereas the performance of the two players with non-uniform horizons was discussed in [9].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Cluster Forming of Multiagent Systems in Rolling Horizon Games with Non-uniform Horizons

Nugraha¹,

Cetinkaya²,

Hayakawa³

et al. 2023

Preprint

View full text Add to dashboard Cite

Consensus and cluster forming of multiagent systems in the face of jamming attacks along with reactive recovery actions by a defender are discussed. The attacker is capable to disable some of the edges of the network with the objective to divide the agents into a smaller size of clusters while, in response, the defender recovers some of the edges by increasing the transmission power. We consider repeated games where the resulting optimal strategies for the two players are derived in a rolling horizon fashion. The attacker and the defender possess different computational abilities to calculate their strategies. This aspect is represented by the non-uniform values of the horizon lengths and the game periods. Theoretical and simulation based results demonstrate the effects of the horizon lengths and the game periods on the agents' states.

show abstract

Section: Problem Formulationmentioning

confidence: 99%

Section: B Non-uniform Game Periodsmentioning

confidence: 99%

Section: Consensus Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cluster Forming of Multiagent Systems in Rolling Horizon Games with Non-uniform Horizons

Nugraha¹,

Cetinkaya²,

Hayakawa³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…We then provide numerical examples on consensus and cluster forming in Section 8 and conclude the paper in Section 9. The conference version of this paper appeared in [21], where we consider a more restricted situation on how often players update their strategies.…”

Section: Introductionmentioning

confidence: 99%

A Rolling Horizon Game Considering Network Effect in Cluster Forming for Dynamic Resilient Multiagent Systems

Nugraha¹,

Cetinkaya²,

Hayakawa³

et al. 2023

Preprint

View full text Add to dashboard Cite

A two-player game-theoretic problem on resilient graphs in a multiagent consensus setting is formulated. An attacker is capable to disable some of the edges of the network with the objective to divide the agents into clusters by emitting jamming signals while, in response, the defender recovers some of the edges by increasing the transmission power for the communication signals. Specifically, we consider repeated games between the attacker and the defender where the optimal strategies for the two players are derived in a rolling horizon fashion based on utility functions that take both the agents' states and the sizes of clusters (known as network effect) into account. The players' actions at each discrete-time step are constrained by their energy for transmissions of the signals, with a less strict constraint for the attacker. Necessary conditions and sufficient conditions of agent consensus are derived, which are influenced by the energy constraints. The number of clusters of agents at infinite time in the face of attacks and recoveries are also characterized. Simulation results are provided to demonstrate the effects of players' actions on the cluster forming and to illustrate the players' performance for different horizon parameters.

show abstract

Rolling Horizon Games for Cluster Formation of Resilient Multiagent Systems

Cited by 2 publications

References 13 publications

Cluster Forming of Multiagent Systems in Rolling Horizon Games with Non-uniform Horizons

Cluster Forming of Multiagent Systems in Rolling Horizon Games with Non-uniform Horizons

A Rolling Horizon Game Considering Network Effect in Cluster Forming for Dynamic Resilient Multiagent Systems

Contact Info

Product

Resources

About