Table of Contents
Fetching ...

Distributed continuous-time strategy-updating rules for noncooperative games with discrete-time communication

Xin Cai, Feng Xiao, Bo Wei, Fang Fang

Abstract

In this paper, continuous-time noncooperative games in networks of double-integrator agents are explored. The existing methods require that agents communicate with their neighbors in real time. In this paper, we propose two discrete-time communication schemes based on the designed continuous-time strategy-updating rule for the efficient use of communication resources. First, the property of the designed continuous-time rule is analyzed to ensure that all agents' strategies can converge to the Nash equilibrium. Then, we propose periodic and event-triggered communication schemes for the implementation of the designed rule with discrete-time communication. The rule in the periodic case is implemented synchronously and easily. The rule in the event-triggered case is executed asynchronously without Zeno behaviors. All agents in both cases can asymptotically reach to the Nash equilibrium by interacting with neighbors at discrete times. Simulations are performed in networks of Cournot competition to illustrate the effectiveness of the proposed methods.

Distributed continuous-time strategy-updating rules for noncooperative games with discrete-time communication

Abstract

In this paper, continuous-time noncooperative games in networks of double-integrator agents are explored. The existing methods require that agents communicate with their neighbors in real time. In this paper, we propose two discrete-time communication schemes based on the designed continuous-time strategy-updating rule for the efficient use of communication resources. First, the property of the designed continuous-time rule is analyzed to ensure that all agents' strategies can converge to the Nash equilibrium. Then, we propose periodic and event-triggered communication schemes for the implementation of the designed rule with discrete-time communication. The rule in the periodic case is implemented synchronously and easily. The rule in the event-triggered case is executed asynchronously without Zeno behaviors. All agents in both cases can asymptotically reach to the Nash equilibrium by interacting with neighbors at discrete times. Simulations are performed in networks of Cournot competition to illustrate the effectiveness of the proposed methods.

Paper Structure

This paper contains 10 sections, 7 theorems, 46 equations, 3 figures, 1 table.

Key Result

Lemma 1

Under Assumption as1, the game $G=(\mathcal{I},\Omega,J)$ admits a pure NE $x^*\in \Omega$ satisfying where $\partial_{x_i} J_i(x_i,x_{-i})\in\mathbb{R}^n$ is the subdifferential of cost function $J_i$ at the strategy $x_i$ for fixed $x_{-i}$.

Figures (3)

  • Figure 1: The evolution of the strategies of all agents following \ref{['csur']} with continuous-time communications and following \ref{['dsur']} with event-triggered communications \ref{['der']}
  • Figure 2: The evolution of the strategies of all agents following \ref{['dsur']} with periodic communications
  • Figure 3: The triggering time sequences of the five agents

Theorems & Definitions (12)

  • Remark 1
  • Definition 1: Basar.1999
  • Lemma 1: Basar.1999
  • Definition 2: Jean.2001
  • Proposition 1: Cortes.2008
  • Lemma 2: Cortes.2008
  • Lemma 3
  • Theorem 1
  • Remark 2
  • Theorem 2
  • ...and 2 more