English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Distributed Nash equilibrium (NE) seeking problem for multi-coalition gameshas attracted increasing attention in recent years, but the research mainlyfocuses on the case without agreement demand within coalitions. This paperconsiders a class of networked games among multiple coalitions where eachcoalition contains multiple agents that cooperate to minimize the sum of theircosts, subject to the demand of reaching an agreement on their state values.Furthermore, the underlying network topology among the agents does not need tobe balanced. To achieve the goal of NE seeking within such a context, twoestimates are constructed for each agent, namely, an estimate of partialderivatives of the cost function and an estimate of global state values, basedon which, an iterative state updating law is elaborately designed. Linearconvergence of the proposed algorithm is demonstrated. It is shown that theconsistency-constrained multi-coalition games investigated in this paper putthe well-studied networked games among individual players and distributedoptimization in a unified framework, and the proposed algorithm can easilydegenerate into solutions to these problems.

Distributed Nash Equilibrium Seeking in Consistency-Constrained Multi-Coalition Games