#6257. Nash equilibrium computation of two-network zero-sum games with event-triggered communication

September 2026publication date
Proposal available till 18-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Control and Optimization;
Control and Systems Engineering;
Information Systems;
Computer Networks and Communications;
Signal Processing;
Artificial Intelligence;
Human-Computer Interaction;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6257.1 Contract №6257.2 Contract №6257.3 Contract №6257.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
In this paper, a zero-sum game Nash equilibrium computation problem with event-triggered communication is investigated under an undirected weight-balanced multi-agent network. A novel distributed event-triggered projection subgradient algorithm is developed to reduce the communication burden within the subnetworks. In the proposed algorithm, when the difference between the current state of the agent and the state of the last trigger time exceeds a given threshold, the agent will be triggered to communicate with its neighbours. Moreover, we prove that all agents converge to Nash equilibrium by the proposed algorithm. Finally, two simulation examples verify that our algorithm not only reduces the communication burden but also ensures that the convergence speed and accuracy are close to that of the time-triggered method under the appropriate threshold.
Keywords:
event-triggered communication; multi-agent network; Nash equilibrium; projection subgradient algorithm; Zero-sum game

Contacts :
0