pith. sign in

arxiv: 2504.19229 · v3 · pith:K7AYVDLQnew · submitted 2025-04-27 · 🧮 math.OC · cs.SY· eess.SY

Robust Nash equilibrium seeking based on semi-Markov switching topologies

Jianing Chen , Sitian Qin , Chuangyin Dang This is my paper

Pith reviewed 2026-05-22 18:53 UTC · model grok-4.3

classification 🧮 math.OC cs.SYeess.SY
keywords Nash equilibrium seekingsemi-Markov switching topologiesintegral sliding-mode controlleader-follower consensusevent-triggered mechanismrobust distributed controlmulti-agent systemsfinite-time convergence
0
0 comments X

The pith

Supertwisting integral sliding-mode control paired with leader-follower consensus achieves finite-time robust Nash equilibrium seeking over semi-Markov switching topologies.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a distributed algorithm for second-order players to locate a Nash equilibrium while facing external disturbances, uncertain dynamics, and communication links that switch according to a semi-Markov process. It merges a supertwisting-based integral sliding-mode controller with a leader-follower consensus protocol so that disturbances are rejected in finite time, the equilibrium is reached, and actions of non-neighboring players are estimated in a distributed way. A sampled-data event-triggered variant is added to cut unnecessary transmissions. Lyapunov-Krasovskii analysis establishes mean-square convergence of the consensus error. The approach is illustrated on a connectivity-control game.

Core claim

By combining supertwisting-based Integral Sliding-Mode Control with a leader-follower consensus protocol, a novel robust NE seeking algorithm is constructed that simultaneously achieves finite-time disturbance rejection, NE seeking for second-order players, and distributed action estimation on non-neighboring players under semi-Markov switching topologies; a sampled-data event-triggered version further reduces information exchange while preserving mean-square leader-follower consensus as shown via Lyapunov-Krasovskii functionals.

What carries the argument

Supertwisting-based integral sliding-mode control integrated with a leader-follower consensus protocol that operates under semi-Markov switching topologies.

If this is right

  • Finite-time rejection of matched disturbances and uncertainties is obtained while the players converge to the Nash equilibrium.
  • Distributed estimation of actions for players outside direct communication range remains accurate despite topology switches.
  • Mean-square consensus is guaranteed for the leader-follower structure under the semi-Markov switching law.
  • The event-triggered sampled-data implementation reduces communication load without destroying the convergence properties.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same sliding-mode-plus-consensus structure could be tested on games with time-varying or stochastic player costs rather than fixed ones.
  • Relaxing the matching-condition assumption would likely replace finite-time rejection with asymptotic rejection, which could be quantified in a follow-up Lyapunov analysis.
  • The event-triggered rule may transfer directly to other distributed optimization tasks such as resource allocation over bandwidth-limited networks.

Load-bearing premise

External disturbances and uncertain dynamics must satisfy matching conditions so the supertwisting ISMC can reject them in finite time, and the communication graphs must switch according to a semi-Markov process.

What would settle it

A numerical simulation or hardware experiment in which the matching condition for disturbances is deliberately violated and the closed-loop trajectories fail to reach the Nash equilibrium or reject disturbances within the claimed finite time.

read the original abstract

This paper investigates a distributed robust Nash Equilibrium (NE) seeking problem for second-order players subject to external disturbances and uncertain dynamics while communicating via semi-Markov switching topologies. To accommodate the above concerns, the following targets require to be reached simultaneously: (1) Disturbances and uncertain dynamics rejection in finite time; (2) NE seeking for the second-order players; (3) Distributed action estimation on non-neighboring players under semi-Markov switching. By combining supertwisting-based Integral Sliding-Mode Control (ISMC) with a leader-follower consensus protocol, a novel robust NE seeking algorithm is constructed. Furthermore, to lessen dispensable information transmission, a sampled-data-based event-triggered mechanism is introduced. Incorporating the advantages of both semi-Markov switching and event-triggered mechanism, another NE seeking algorithm is proposed. Theoretical analysis via a Lyapunov-Krasovskii functional proves the leader-follower consensus can be achieved in the mean-square sense. Finally, a connectivity control game is formulated to validate the algorithms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The manuscript investigates distributed robust Nash equilibrium seeking for second-order players subject to external disturbances and uncertain dynamics communicating over semi-Markov switching topologies. It constructs a novel algorithm by combining supertwisting-based integral sliding-mode control with a leader-follower consensus protocol to simultaneously achieve finite-time disturbance rejection, NE seeking, and distributed action estimation. A sampled-data event-triggered mechanism is added to reduce communication load, and mean-square consensus is established via Lyapunov-Krasovskii analysis. The results are illustrated on a connectivity control game.

Significance. If the central derivations hold, particularly the finite-time rejection and mean-square stability under the stated conditions, the work would advance robust distributed game-theoretic control in uncertain and intermittently connected multi-agent systems. The combination of ISMC robustness with consensus protocols and event-triggering offers practical efficiency gains for networked optimization problems.

major comments (3)
  1. [Problem formulation] Problem formulation (player dynamics): The second-order model is stated with lumped disturbances and uncertain dynamics, but no explicit verification is given that these terms satisfy the matching condition with respect to the control vector field. This matching is required for the supertwisting ISMC to guarantee finite-time rejection and is load-bearing for the robustness claim; without it the subsequent consensus analysis does not follow.
  2. [Main results] Main results (Lyapunov-Krasovskii analysis): The proof of mean-square leader-follower consensus under semi-Markov switching relies on a Lyapunov-Krasovskii functional whose derivative is claimed to be negative definite, yet the explicit bounds on the transition rates, the event-triggering thresholds, and the residual terms after ISMC are not derived in sufficient detail to confirm the inequality holds uniformly.
  3. [Main results] Theorem on finite-time convergence: The finite-time disturbance rejection is asserted via the supertwisting ISMC, but the reaching time estimate and its dependence on the semi-Markov sojourn times are not provided, leaving open whether the overall NE seeking remains finite-time when topologies switch.
minor comments (2)
  1. [Preliminaries] Notation for the semi-Markov process (transition rate matrix) should be introduced earlier and used consistently when stating the mean-square stability conditions.
  2. [Algorithm design] The event-triggered condition is defined with a threshold parameter, but its selection guideline relative to the ISMC gains is missing, which would aid reproducibility.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive major comments. We address each point below with clarifications and indicate the revisions that will be incorporated.

read point-by-point responses

  1. Referee: [Problem formulation] Problem formulation (player dynamics): The second-order model is stated with lumped disturbances and uncertain dynamics, but no explicit verification is given that these terms satisfy the matching condition with respect to the control vector field. This matching is required for the supertwisting ISMC to guarantee finite-time rejection and is load-bearing for the robustness claim; without it the subsequent consensus analysis does not follow.

    Authors: The player dynamics are written in the standard matched form for second-order systems: the lumped uncertain dynamics and external disturbances enter through the same channel as the control input. This is the modeling assumption that enables the supertwisting ISMC to achieve finite-time rejection. We will add an explicit remark in Section II stating that the disturbance vector lies in the range of the input matrix, thereby satisfying the matching condition by construction. revision: yes

  2. Referee: [Main results] Main results (Lyapunov-Krasovskii analysis): The proof of mean-square leader-follower consensus under semi-Markov switching relies on a Lyapunov-Krasovskii functional whose derivative is claimed to be negative definite, yet the explicit bounds on the transition rates, the event-triggering thresholds, and the residual terms after ISMC are not derived in sufficient detail to confirm the inequality holds uniformly.

    Authors: We agree that the bounds require more explicit derivation. In the revised proof we will (i) state the admissible range for the semi-Markov transition rates, (ii) incorporate the event-triggering threshold directly into the upper bound of the Lyapunov derivative, and (iii) show that the ISMC residual is dominated by a tunable constant. These steps will be written out so that negative definiteness holds uniformly under the stated gain conditions. revision: yes

  3. Referee: [Main results] Theorem on finite-time convergence: The finite-time disturbance rejection is asserted via the supertwisting ISMC, but the reaching time estimate and its dependence on the semi-Markov sojourn times are not provided, leaving open whether the overall NE seeking remains finite-time when topologies switch.

    Authors: The supertwisting reaching time is finite and depends only on the initial sliding variable and the chosen gains; it is independent of the topology. We will add a short lemma that bounds this reaching time and notes that, provided the minimum sojourn time of the semi-Markov process exceeds the reaching time (a mild and checkable condition), the overall NE seeking retains its finite-time character. This clarification will be inserted after the ISMC analysis. revision: partial

Circularity Check

0 steps flagged

No circularity: derivation uses standard Lyapunov-Krasovskii analysis on explicitly stated assumptions

full rationale

The paper constructs a robust NE-seeking controller by combining supertwisting ISMC with a leader-follower consensus protocol and proves mean-square stability via a Lyapunov-Krasovskii functional under the stated semi-Markov switching and matching-condition assumptions. No step equates a claimed prediction or first-principles result to its own fitted inputs, self-citations, or ansatzes by construction; the matching conditions are asserted as problem data rather than derived from the controller equations themselves. The analysis is therefore self-contained against external benchmarks and receives the default non-circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach rests on standard domain assumptions from sliding-mode control and switching systems theory; no free parameters or invented entities are identifiable from the abstract alone.

axioms (2)
  • domain assumption Communication topologies follow semi-Markov switching processes
    Invoked to model the time-varying network in the problem formulation.
  • domain assumption External disturbances and uncertain dynamics satisfy matching conditions for ISMC
    Required to guarantee finite-time rejection as stated in the targets.

pith-pipeline@v0.9.0 · 5710 in / 1346 out tokens · 33949 ms · 2026-05-22T18:53:33.909225+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

45 extracted references · 45 canonical work pages

  1. [1]

    Distributed algorithm design for aggregative games of Euler- Lagrange systems and its application to smart grids,

    Z. Deng, “Distributed algorithm design for aggregative games of Euler- Lagrange systems and its application to smart grids,” IEEE Transactions on Cybernetics, 2021

    work page 2021

  2. [2]

    Distributed Nash equilibrium seeking by a consensus based approach,

    M. Ye and G. Hu, “Distributed Nash equilibrium seeking by a consensus based approach,” IEEE Transactions on Automatic Control , vol. 62, no. 9, pp. 4811–4818, 2017

    work page 2017

  3. [3]

    Learning generalized Nash equilib- ria in multi-agent dynamical systems via extremum seeking control,

    S. Krila ˇsevi´c and S. Grammatico, “Learning generalized Nash equilib- ria in multi-agent dynamical systems via extremum seeking control,” Automatica, vol. 133, p. 109846, 2021

    work page 2021

  4. [4]

    Distributed Nash equilibrium seeking: A gossip-based algorithm,

    F. Salehisadaghiani and L. Pavel, “Distributed Nash equilibrium seeking: A gossip-based algorithm,” Automatica, vol. 72, pp. 209–216, 2016

    work page 2016

  5. [5]

    Logical dynamic games: Models, equilibria, and potentials,

    C. Li, A. Li, Y . Wu, and L. Wang, “Logical dynamic games: Models, equilibria, and potentials,” IEEE Transactions on Automatic Control, pp. 1–15, 2024

    work page 2024

  6. [6]

    Incorporation of likely future actions of agents into pseudo-gradient dynamics of noncooperative games,

    Y . Yan and T. Hayakawa, “Incorporation of likely future actions of agents into pseudo-gradient dynamics of noncooperative games,” IEEE Transactions on Automatic Control , pp. 1–16, 2024

    work page 2024

  7. [7]

    Robust distributed Nash equilibrium seeking for games under attacks and communication delays,

    X.-F. Wang, X.-M. Sun, M. Ye, and K.-Z. Liu, “Robust distributed Nash equilibrium seeking for games under attacks and communication delays,” IEEE Transactions on Automatic Control , 2022

    work page 2022

  8. [8]

    Event-triggered Nash equi- librium seeking for multiagent systems with stubborn ESO,

    Y . Yuan, C. Ma, L. Guo, and P. Zhang, “Event-triggered Nash equi- librium seeking for multiagent systems with stubborn ESO,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , 2022

    work page 2022

  9. [9]

    Distributed Nash equilibrium seeking: Continuous-time control-theoretic approaches,

    G. Hu, Y . Pang, C. Sun, and Y . Hong, “Distributed Nash equilibrium seeking: Continuous-time control-theoretic approaches,” IEEE Control Systems Magazine, vol. 42, no. 4, pp. 68–86, 2022

    work page 2022

  10. [10]

    Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents,

    M. Bianchi and S. Grammatico, “Continuous-time fully distributed generalized Nash equilibrium seeking for multi-integrator agents,” Au- tomatica, vol. 129, p. 109660, 2021

    work page 2021

  11. [11]

    Distributed learning for stochastic generalized Nash equilibrium problems,

    C.-K. Yu, M. Van Der Schaar, and A. H. Sayed, “Distributed learning for stochastic generalized Nash equilibrium problems,” IEEE Transactions on Signal Processing , vol. 65, no. 15, pp. 3893–3908, 2017

    work page 2017

  12. [12]

    Distributed generalized Nash equilibrium seeking: A singular perturbation-based approach,

    W.-T. Lin, G. Chen, C. Li, and T. Huang, “Distributed generalized Nash equilibrium seeking: A singular perturbation-based approach,” Neurocomputing, vol. 482, pp. 278–286, 2022

    work page 2022

  13. [13]

    Distributed algorithms for searching gen- eralized Nash equilibrium of noncooperative games,

    K. Lu, G. Jing, and L. Wang, “Distributed algorithms for searching gen- eralized Nash equilibrium of noncooperative games,” IEEE Transactions on Cybernetics, vol. 49, no. 6, pp. 2362–2371, 2018

    work page 2018

  14. [14]

    Nash equilibrium seeking for general linear systems with disturbance rejection,

    X. Cai, F. Xiao, B. Wei, M. Yu, and F. Fang, “Nash equilibrium seeking for general linear systems with disturbance rejection,” IEEE Transactions on Cybernetics , 2022

    work page 2022

  15. [15]

    Adaptive tracking games for coupled stochas- tic linear multi-agent systems: Stability, optimality and robustness,

    Q. Zhang and J.-F. Zhang, “Adaptive tracking games for coupled stochas- tic linear multi-agent systems: Stability, optimality and robustness,” IEEE Transactions on Automatic Control , vol. 58, no. 11, pp. 2862– 2877, 2013

    work page 2013

  16. [16]

    Distributed-observer-based Nash equi- librium seeking algorithm for quadratic games with nonlinear dynamics,

    B. Huang, Y . Zou, and Z. Meng, “Distributed-observer-based Nash equi- librium seeking algorithm for quadratic games with nonlinear dynamics,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , vol. 51, no. 11, pp. 7260–7268, 2020

    work page 2020

  17. [17]

    Distributed Nash equilibrium seeking for aggregative games with nonlinear dynamics under external disturbances,

    Y . Zhang, S. Liang, X. Wang, and H. Ji, “Distributed Nash equilibrium seeking for aggregative games with nonlinear dynamics under external disturbances,” IEEE Transactions on Cybernetics , vol. 50, no. 12, pp. 4876–4885, 2019. 14

    work page 2019

  18. [18]

    Distributed robust Nash equilibrium computation with uncertain dynamics and disturbances,

    D. Li, M. Ye, L. Ding, and S. Xu, “Distributed robust Nash equilibrium computation with uncertain dynamics and disturbances,” IEEE Transac- tions on Network Science and Engineering , 2022

    work page 2022

  19. [19]

    A dynamic market mechanism for the integration of renewables and demand response,

    J. Knudsen, J. Hansen, and A. M. Annaswamy, “A dynamic market mechanism for the integration of renewables and demand response,” IEEE Transactions on Control Systems Technology , vol. 24, no. 3, pp. 940–955, 2015

    work page 2015

  20. [20]

    Distributed subgradient methods for convex optimization over random networks,

    I. Lobel and A. Ozdaglar, “Distributed subgradient methods for convex optimization over random networks,” IEEE Transactions on Automatic Control, vol. 56, no. 6, pp. 1291–1306, 2010

    work page 2010

  21. [21]

    Resilient distributed optimization algorithm against adversarial attacks,

    C. Zhao, J. He, and Q. Wang, “Resilient distributed optimization algorithm against adversarial attacks,” IEEE Transactions on Automatic Control, vol. 65, no. 10, pp. 4308–4315, 2019

    work page 2019

  22. [22]

    Stabilization of discrete-time switched systems with constraints by dynamic logic-based switching feedback,

    Y . Guo, P. Gong, Y . Wu, X.-M. Sun, and W. Gui, “Stabilization of discrete-time switched systems with constraints by dynamic logic-based switching feedback,” Automatica, vol. 156, p. 111190, 2023

    work page 2023

  23. [23]

    Reliability evaluation of fault tolerant control with a semi-Markov fault detection and isolation model,

    H. Li and Q. Zhao, “Reliability evaluation of fault tolerant control with a semi-Markov fault detection and isolation model,” Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, vol. 220, no. 5, pp. 329–338, 2006

    work page 2006

  24. [24]

    Empirical estimator of sta- tionary distribution for semi-Markov processes,

    N. Limnios, B. Ouhbi, and A. Sadek, “Empirical estimator of sta- tionary distribution for semi-Markov processes,” Communications in Statistics—Theory and Methods , vol. 34, no. 4, pp. 987–995, 2005

    work page 2005

  25. [25]

    Schwartz, Control of Semi-Markov Jump Linear Systems with Appli- cation to the Bunch-Train Cavity Interaction

    C. Schwartz, Control of Semi-Markov Jump Linear Systems with Appli- cation to the Bunch-Train Cavity Interaction. Northwestern University, 2003

    work page 2003

  26. [26]

    Distributed discrete-time Nash equilibrium seeking with Markovian switching topologies,

    X. Fang, G. Wen, K. Zhang, and M. Ye, “Distributed discrete-time Nash equilibrium seeking with Markovian switching topologies,” in 2019 IEEE Symposium Series on Computational Intelligence (SSCI) . IEEE, 2019, pp. 1988–1993

    work page 2019

  27. [27]

    Distributed Nash equilibrium seeking under event-triggered mechanism,

    K. Zhang, X. Fang, D. Wang, Y . Lv, and X. Yu, “Distributed Nash equilibrium seeking under event-triggered mechanism,” IEEE Transac- tions on Circuits and Systems II: Express Briefs , vol. 68, no. 11, pp. 3441–3445, 2021

    work page 2021

  28. [28]

    Nash equilibrium seeking for graphic games with dynamic event-triggered mechanism,

    P. Zhang, Y . Yuan, H. Liu, and Z. Gao, “Nash equilibrium seeking for graphic games with dynamic event-triggered mechanism,” IEEE Transactions on Cybernetics , 2021

    work page 2021

  29. [29]

    2-Representing information,

    Y . Anzai, “2-Representing information,” in Pattern Recognition & Ma- chine Learning. San Francisco: Morgan Kaufmann, 1992, pp. 13–48

    work page 1992

  30. [30]

    Finite-time consensus for second-order multi- agent systems with disturbances by integral sliding mode,

    S. Yu and X. Long, “Finite-time consensus for second-order multi- agent systems with disturbances by integral sliding mode,” Automatica, vol. 54, pp. 158–165, 2015

    work page 2015

  31. [31]

    Distributed average tracking of multiple time-varying reference signals with bounded derivatives,

    F. Chen, Y . Cao, and W. Ren, “Distributed average tracking of multiple time-varying reference signals with bounded derivatives,” IEEE Trans- actions on Automatic Control , vol. 57, no. 12, pp. 3169–3174, 2012

    work page 2012

  32. [32]

    Wirtinger-based integral inequality: Ap- plication to time-delay systems,

    A. Seuret and F. Gouaisbaut, “Wirtinger-based integral inequality: Ap- plication to time-delay systems,” Automatica, vol. 49, no. 9, pp. 2860– 2866, 2013

    work page 2013

  33. [33]

    H. K. Khalil, Nonlinear Systems, 3rd ed. NJ, USA: Prentice Hall, 2002

    work page 2002

  34. [34]

    Distributed robust finite-time nonlinear consensus protocols for multi-agent systems,

    Z. Zuo and L. Tie, “Distributed robust finite-time nonlinear consensus protocols for multi-agent systems,” International Journal of Systems Science, vol. 47, no. 6, pp. 1366–1375, 2016

    work page 2016

  35. [35]

    12 Nash equilibria: The variational approach,

    F. Facchinei and J.-S. Pang, “12 Nash equilibria: The variational approach,” Convex Optimization in Signal Processing and Communi- cations, p. 443, 2010

    work page 2010

  36. [36]

    Distributed robust Nash equilibrium seeking for aggregative games under persistent attacks: A hybrid systems approach,

    X.-F. Wang, X.-M. Sun, A. R. Teel, and K.-Z. Liu, “Distributed robust Nash equilibrium seeking for aggregative games under persistent attacks: A hybrid systems approach,” Automatica, vol. 122, p. 109255, 2020

    work page 2020

  37. [37]

    Strict Lyapunov functions for the super- twisting algorithm,

    J. A. Moreno and M. Osorio, “Strict Lyapunov functions for the super- twisting algorithm,” IEEE Transactions on Automatic Control , vol. 57, no. 4, pp. 1035–1040, 2012

    work page 2012

  38. [38]

    Adaptation mechanism of asymmetri- cal potential field improving precision of position tracking in the case of nonholonomic UA Vs,

    C. Kownacki and L. Ambroziak, “Adaptation mechanism of asymmetri- cal potential field improving precision of position tracking in the case of nonholonomic UA Vs,”Robotica, vol. 37, no. 10, pp. 1823–1834, 2019

    work page 2019

  39. [39]

    Distributed seeking of Nash equilibria with applications to mobile sensor networks,

    M. S. Stankovic, K. H. Johansson, and D. M. Stipanovic, “Distributed seeking of Nash equilibria with applications to mobile sensor networks,” IEEE Transactions on Automatic Control , vol. 57, no. 4, pp. 904–919, 2011

    work page 2011

  40. [40]

    An improved reciprocally convex inequality and an augmented Lyapunov–Krasovskii functional for stability of linear systems with time-varying delay,

    X.-M. Zhang, Q.-L. Han, A. Seuret, and F. Gouaisbaut, “An improved reciprocally convex inequality and an augmented Lyapunov–Krasovskii functional for stability of linear systems with time-varying delay,” Automatica, vol. 84, pp. 221–226, 2017

    work page 2017

  41. [41]

    Mean-square stability of two-time scale linear stochastic hybrid systems,

    E. Seroka and L. Socha, “Mean-square stability of two-time scale linear stochastic hybrid systems,” Procedia IUTAM, vol. 6, pp. 194–203, 2013

    work page 2013

  42. [42]

    RISE-based adaptive control of hydraulic systems with asymptotic tracking,

    J. Yao, W. Deng, and Z. Jiao, “RISE-based adaptive control of hydraulic systems with asymptotic tracking,” IEEE Transactions on Automation Science and Engineering , vol. 14, no. 3, pp. 1524–1531, 2015

    work page 2015

  43. [43]

    Distributed robust nash equilibrium seeking for mixed-order games by a neural-network-based approach,

    M. Ye, L. Ding, and J. Yin, “Distributed robust nash equilibrium seeking for mixed-order games by a neural-network-based approach,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , 2023

    work page 2023

  44. [44]

    Event-triggered leader-following consensus for multi-agent systems with semi-Markov switching topologies,

    J. Dai and G. Guo, “Event-triggered leader-following consensus for multi-agent systems with semi-Markov switching topologies,” Informa- tion Sciences, vol. 459, pp. 290–301, 2018

    work page 2018

  45. [45]

    Mean square consensus of second-order multi-agent systems under Markov switching topologies,

    G. Miao, S. Xu, B. Zhang, and Y . Zou, “Mean square consensus of second-order multi-agent systems under Markov switching topologies,” IMA Journal of Mathematical Control and Information , vol. 31, no. 2, pp. 151–164, 2014

    work page 2014