Pith. sign in

REVIEW 4 major objections 4 minor 35 references

A Hybrid Adaptive Nash Equilibrium Solver for Distributed Multi-Agent Systems with Game-Theoretic Jump Triggering

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims a distributed hybrid controller whose Nash equilibrium strategies drive multi-agent consensus errors to zero exponentially, at linear per-agent computational cost.

desk verdict A sensible hybrid-game framing let down by a load-bearing derivation gap and simulations that violate its own assumptions. read the letter →

arxiv 2506.11304 v1 pith:BS5HJAHB submitted 2025-06-12 eess.SY cs.SY

Qiuyu Miao , Zhigang Wu This is my paper
classification eess.SYcs.SY
keywords hybriddynamicalsystemsmulti-agentdistributedcontrolNashequilibriumgame-theoreticjumptriggeringHamilton-Jacobi-Bellmanequationconsensusevent-triggered
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper proposes a distributed algorithm, HANES, that computes Nash equilibrium strategies for multi-agent systems whose dynamics are hybrid: agents flow continuously and jump at discrete triggers. The claim is that, under stabilizability, observability, and a small-coupling condition on the communication graph, the resulting equilibrium strategies drive consensus errors to zero exponentially while preserving stability through jumps. The payoff of the claim is scalability: each agent computes its strategy with linear cost in the number of agents rather than cubic cost, and no agent needs global information. This matters because existing event-triggered and game-theoretic methods either assume purely continuous dynamics or scale poorly.

What carries the argument

The load-bearing object is the coupled HJB/Riccati system: each agent's value function is assumed quadratic, $V_i(e_i)=e_i^T P_i e_i$, and the matrices $P_i$ solve equation (25), a per-agent algebraic Riccati equation modified by a coupling term $\Xi_i = \sum_{j\in\mathcal{N}_i} \Gamma_{ij}(P_i)$. The jump mechanism is encoded by the jump set $D$ and the post-jump penalty $P_i\|e_i^+\|^2$ in the cost function (9). Theorem 1 proves contraction of the fixed-point map on the positive-definite cone, which yields existence and uniqueness of the equilibrium, and Theorem 2 uses the same value-function matrices as a Lyapunov function to obtain exponential convergence of the consensus errors.

What would settle it

For a concrete two-agent or three-agent system with nonzero off-diagonal interaction weights, compute the left-hand side of equation (25) using the true coupling term $\Phi_i(u_{-i}^*)$ from equation (21). If the resulting expression contains bilinear terms $e_i^T P_i B R_j^{-1} B^T P_j e_j$ that cannot be represented by any $\Xi_i$ independent of $e_j$, then the derivation of (25) from (24) fails, and a numerical search over small graphs could exhibit non-convergence of consensus or the absence of a fixed point to the claimed contraction map.

Watch

Extended reading notes

Core claim

The central claim is that a multi-agent hybrid system can be stabilized to consensus by a distributed Nash equilibrium strategy profile. Each agent minimizes a quadratic cost with a jump penalty, and the optimal controls solve a system of coupled algebraic Hamilton-Jacobi-Bellman equations that reduce to per-agent algebraic Riccati equations. Theorem 2 asserts exponential convergence of all consensus errors for the resulting closed loop, with decay rate given in terms of the value-function matrices. The authors prove existence and uniqueness of the equilibrium via a contraction mapping on positive-definite matrices, and the HANES algorithm separates continuous strategy optimization within each mode from discrete mode selection, which yields the claimed O(N) complexity.

Load-bearing premise

The proof that the coupled HJB equations reduce to per-agent Riccati equations, equation (25), hinges on assuming the neighbor coupling term can be absorbed into a term $\Xi_i$ that depends only on agent $i$; if the true coupling contains bilinear products of different agents' error states, this step needs a separability or small-gain condition that the paper does not state.

Editorial extensions

If this is right

  • If the central claim is correct, multi-agent hybrid systems can be stabilized using only neighbor information, with each agent solving a local Riccati equation rather than a centralized problem.
  • Consensus recovery after discrete jump events is formally guaranteed, because jump stability is handled by the jump penalty and the contraction condition on the coupling weights.
  • The O(N) per-agent computational complexity makes the approach feasible for large swarms, unlike centralized methods with cubic complexity.
  • The same framework covers leader-follower tracking when the communication graph contains a spanning tree, giving bounded tracking errors and exponential convergence.
  • Game-theoretic jump triggering provides a principled alternative to event-triggered control for hybrid tasks, coordinating mode transitions across agents without global coordination.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension is heterogeneous agents with distinct state dimensions and control authorities; the paper states its formulation assumes homogeneous scalar dynamics, so the Riccati fixed-point proof would need to be re-examined for mixed agent models.
  • If equation (25) is only an approximation, a small-gain or monotonicity condition on the coupling weights may be needed to keep the closed loop stable; readers can test this by checking whether the coupling terms remain bounded when neighbor errors are large.
  • The pursuit-evasion and leader-follower experiments use scalar dynamics and small graphs; scaling to higher-dimensional states or larger networks would test whether the O(N) complexity claim holds in practice.
  • Learning the jump thresholds and flow-set parameters online, rather than fixing them a priori, is a plausible next step that the paper itself lists as future work.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes a hybrid adaptive Nash equilibrium solver (HANES) for distributed multi-agent systems. Each agent minimizes a quadratic cost while the system evolves through continuous flows and discrete jumps, with jump times coordinated by a game-theoretic triggering mechanism. The authors claim sufficient conditions for exponential convergence to consensus, an O(N) computational complexity relative to centralized O(N^3) approaches, and validate the framework with pursuit-evasion and leader-follower simulations. The central derivation proceeds from a coupled HJB system to per-agent algebraic Riccati equations, followed by a contraction argument and a Lyapunov-based exponential stability proof.

Significance. If the theoretical claims were correct, the paper would offer a substantial contribution: a distributed, hybrid, game-theoretic controller with exponential convergence and linear per-agent complexity, grounded in Nash equilibrium computation. The authors also provide what appears to be a self-contained algorithmic procedure and two simulation scenarios. However, the soundness of the core derivation is the deciding issue. The step from the coupled HJB equation (24) to the decoupled Riccati equation (25) is invalid as written, and this invalid step underpins Theorems 1 and 2, the contraction argument, and the O(N) complexity claim. Because the central theoretical results rest on this unsupported step, the significance of the paper in its current form is limited.

major comments (4)
  1. [Section III, Eqs. (24)-(25)] The passage from equation (24) to equation (25) is not justified. Equation (24) contains the term 2 e_i^T P_i Phi_i(u_{-i}^*), where Phi_i(u_{-i}^*) = -B sum_{j in N_i} a_ij u_j^* - B sum_{l in L} b_il u_l^*. Substituting the candidate equilibrium controls u_j^* = -(1/2)(d_j + sum_k b_jk) R_j^{-1} B^T P_j e_j gives a bilinear term in e_i and e_j of the form e_i^T P_i B a_ij (d_j + sum_k b_jk) R_j^{-1} B^T P_j e_j, plus an analogous leader term. The text states that 'for this equation to hold for all e_i' the matrix equation (25) follows, with the coupling absorbed into Xi_i = sum_{j in N_i} Gamma_ij(P_i). A bilinear form in e_i and e_j cannot be represented as e_i^T Xi_i e_i with a state-independent Xi_i unless the cross terms vanish or are controlled by an additional small-gain or structural separability condition. No such condition is stated or proved. This step is load-bearing: Theorems 1 and 2, the contraction bound in the proof of Theorem 1, and the O(N) complexity claim all rely on the decoupled Riccati structure of equation (25).
  2. [Theorem 1, condition (iv)] Condition (iv) of Theorem 1 requires the coupling weights to satisfy sum_{j in N_i} a_ij + sum_{l in L} b_il < alpha for alpha < 2 sqrt(lambda_min(R_i)/lambda_max(B^T P_i B)), where P_i is the positive definite solution of equation (25). Since P_i is the unknown fixed point of the Riccati-type operator, this condition cannot be verified a priori; it depends on the very solution whose existence the theorem is supposed to establish. This circularity is not resolved in the proof. The contraction factor beta in Step 3 of the proof is also asserted to be less than 1 solely from 'the communication weights and system parameters,' without a derivation from the actual coupled equations.
  3. [Theorem 2, proof] The proof of Theorem 2 asserts the bound |coupling terms| <= gamma sum_{j in N_i} a_ij |e_j| and then concludes W_dot(e) <= -mu |e|^2 for some mu > 0. Neither inequality is derived. The coupling terms involve products of the form B R_j^{-1} B^T P_j e_j and B R_l^{-1} B^T P_l e_l, and their contribution to the Lyapunov derivative must be bounded by terms that are dominated by the negative definite part coming from the Riccati solution. The proof does not show that condition (iv), even if it were verifiable, implies this domination. The decay rate rho = mu/(2 lambda_max(P^*)) is therefore unsupported.
  4. [Section IV, pursuit-evasion experiment] The pursuit-evasion simulation uses input cost weights for the evaders R_c,evaders = diag(-4, -3.5). The paper's framework assumes R_i = R_i^T > 0 in the cost functional (9), in the optimal control law (14), and in Assumption 1's quadratic value function. Negative control weights violate these assumptions, so the experiment does not validate the theorem conditions. The simulation also uses scalar dynamics (n=1) while the theoretical framework is stated for general state dimension n, and no code or comparison baseline is provided to substantiate the claimed O(N) computational complexity.
minor comments (4)
  1. [Notation and typos] There are numerous typographical errors and notation inconsistencies, including garbled text in equations (6) and (8), a missing threshold value in Algorithm Step 2 ('if |x_i - mu| >= then'), and repeated misspellings such as 'Jthisnal' for 'Journal' in references [5], [6], [20], [21], [25], and [33].
  2. [Corollary 1] Corollary 1 states that exponential stability across jumps holds 'if the jump maps satisfy |G_i(e_i,u_i^*)| <= sigma |e_i| for some sigma < 1.' This is stated as an assumption, not derived from the preceding theory; the paper should clarify whether this condition is an additional design requirement or a consequence of the framework, and it should be verified in the simulations where jumps are described as randomly selecting states in an interval rather than satisfying this contraction bound.
  3. [Equation (9) and jump cost] The cost functional in equation (9) includes an infinite sum over jump penalties P_i ||e_i(t_k^+)||^2, but the hybrid dynamics do not define a lower bound on inter-jump times. Without a dwell-time condition, Zeno behavior could make the sum ill-defined; this issue is not discussed.
  4. [Reference quality] Several references appear inaccurate or incomplete: reference [17] is a paper on disease spreading, not on consensus analysis of hybrid multiagent systems, and references [12]-[14] are attributed to Sanfelice with titles that do not match standard bibliographic records. The reference list should be carefully revised.

Circularity Check

2 steps flagged · score 6.0 of 10

The exponential-convergence and O(N) claims rest on an imposed decoupled Riccati equation (25) and a self-referential contraction condition (iv), making the derivation circular rather than externally grounded.

  1. self definitional [Section III, Theorem 1, condition (iv)]
    "(iv) The coupling weights satisfy ∑ a_ij + ∑ b_il < α for some α < 2√(λ_min(R_i)/λ_max(B^T P_i B))"

    Condition (iv) quantifies over λ_max(B^T P_i B), where P_i is the unknown matrix that equation (25) is supposed to determine and that Theorem 1 is meant to construct. In Step 3 the proof invokes condition (iv) to show that T is a contraction, so the contraction constant depends on the fixed point before the fixed point is known. The existence/uniqueness conclusion is therefore conditional on properties of the object being constructed, and the stated sufficient condition cannot be verified independently of solving the Riccati equation that is the theorem's conclusion.

  2. other [Section III, Equations (24)-(25)]
    "For this equation to hold for all e_i, require: Q_i + P_i A + A^T P_i − (d_i + ∑ b_il)^2 P_i B R_i^{-1} B^T P_i + Ξ_i = 0 (25) where Ξ_i = Σ_{j∈N_i} Γ_ij(P_i) captures the coupling effects from neighboring agents and will be analyzed in the convergence proof."

    Equation (24) contains 2e_i^T P_i Φ_i(u_{-i}^*) with Φ_i = −BΣ a_ij u_j^* − BΣ b_il u_l^*. Substituting u_j^* = −1/2(d_j+Σb_jk)R_j^{-1}B^T P_j e_j makes this term bilinear in e_i and e_j. The sentence 'For this equation to hold for all e_i' cannot convert a bilinear coupling into a state-independent Ξ_i without a separability or small-gain condition, none of which is stated or proved. Ξ_i is imposed, and the later contraction/coupling bounds in Theorem 2 are asserted rather than derived from (24). Theorems 1-2 and the O(N) claim all rest on this imposed Riccati equation, so the results reduce to the construction of (25) rather than a derivation from the coupled HJB system.

full rationale

The paper's central proof chain is internally self-referential rather than grounded in independent conditions. Theorem 1's condition (iv) is stated in terms of λ_max(B^T P_i B), which is the unknown solution entering equation (25), and the contraction argument in Step 3 explicitly relies on this condition, so the existence theorem's hypotheses cannot be checked before the object it is meant to produce. Independently, the passage from the coupled HJB equation (24) to the per-agent algebraic Riccati equation (25) replaces the genuinely neighbor-dependent bilinear term 2e_i^T P_i Φ_i(u_{-i}^*) with an uncomputed state-independent term Ξ_i = Σ Γ_ij(P_i). No derivation of Γ_ij from the original coupling is supplied; the paper only says that it 'captures' the couplings and will be analyzed later, and the later analysis is an asserted bound rather than a consequence of (24). Theorem 2's exponential convergence and the O(N) complexity claim inherit this imposed decoupling. This is not a self-citation-chain issue and no external theorem is smuggled in under a same-author citation; the circularity is internal to the derivation. Corollary 1's contraction assumption |G_i| ≤ σ|e_i| is a standard sufficient condition for jump stability but is not derived from the HJB construction, so it does not independently certify the hybrid stability claim. The simulations cannot repair the defect because they use scalar dynamics and evader cost weights diag(−4,−3.5), outside Assumption 1's R_i ≻ 0. Overall, two load-bearing reductions are imposed by definition, giving partial circularity rather than full equivalence.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claim rests on Assumption 1, a hidden separability assumption in the HJB reduction, and a contraction bound on jumps. The proof introduces uncomputed constants beta, gamma, mu, and sigma. No new physical entities are postulated.

free parameters (4)
  • beta (contraction factor in Theorem 1 Step 3) = <1 (asserted, not computed)
    Introduced ad hoc in the proof; no formula or bound in terms of system data is given, so the contraction of operator T is not verified.
  • gamma (coupling bound coefficient in Theorem 2) = unspecified
    The bound |coupling terms| <= gamma sum a_ij |e_j| is asserted; gamma is never computed or related to problem data.
  • mu (Lyapunov decay lower bound) = unspecified
    The paper states W_dot <= -mu |e|^2 for some mu>0 without giving mu or proving its existence from the stated assumptions.
  • sigma (jump contraction bound) = <1 (assumed)
    Used in Corollary 1; the actual jump map in simulations is a random selection in [0.3,0.5], which is not shown to satisfy this contraction property.
assumptions (4)
  • ad hoc to paper Assumption 1: value functions are quadratic, V_i(e_i) = e_i^T P_i e_i.
    This ansatz is not derived from the system dynamics and is central to the reduction to equation (25).
  • domain assumption Graph contains a spanning tree; (A,B) stabilizable; (A,Q_i^{1/2}) observable.
    These are standard sufficient conditions in LQ control and consensus, stated in Theorem 1.
  • ad hoc to paper Hidden separability of the HJB coupling: cross terms between e_i and e_j can be absorbed into Xi_i without altering the per-agent Riccati structure.
    The passage from (24) to (25) silently drops bilinear terms in e_i and neighbor states; no separability, small-gain, or vanishing-cross-terms condition is stated.
  • ad hoc to paper Jump maps satisfy |G_i(e_i,u_i^*)| <= sigma |e_i| with sigma<1.
    Corollary 1 assumes the jump map already contracts the error; this is not derived from the flow or game parameters and is essentially the stability property to be proved.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Hybrid Adaptive Nash Equilibrium Solver for Distributed Multi-Agent Systems with Game-Theoretic Jump Triggering." pith.science (2026). https://pith.science/paper/BS5HJAHB

@misc{pith2026250611304,
  author       = {Pith},
  title        = {Pith review of: A Hybrid Adaptive Nash Equilibrium Solver for Distributed Multi-Agent Systems with Game-Theoretic Jump Triggering},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BS5HJAHB}},
  note         = {Machine review of arXiv:2506.11304}
}
read the original abstract

This paper presents a hybrid adaptive Nash equilibrium solver for distributed multi-agent systems incorporating game-theoretic jump triggering mechanisms. The approach addresses fundamental scalability and computational challenges in multi-agent hybrid systems by integrating distributed game-theoretic optimization with systematic hybrid system design. A novel game-theoretic jump triggering mechanism coordinates discrete mode transitions across multiple agents while maintaining distributed autonomy. The Hybrid Adaptive Nash Equilibrium Solver (HANES) algorithm integrates these methodologies. Sufficient conditions establish exponential convergence to consensus under distributed information constraints. The framework provides rigorous stability guarantees through coupled Hamilton-Jacobi-Bellman equations while enabling rapid emergency response capabilities through coordinated jump dynamics. Simulation studies in pursuit-evasion and leader-follower consensus scenarios demonstrate significant improvements in convergence time, computational efficiency, and scalability compared to existing centralized and distributed approaches.

Figures

Figures reproduced from arXiv: 2506.11304 by the authors.

Figure 1
Figure 1. Overall Framework Architecture of the Hybrid Adaptive Nash Equilibrium Solver Hybrid Systems with Multi-Agent Consider hybrid dynamical systems that exhibit both continuous and discrete behavior. A hybrid system ℋ is described by the hybrid inclusion: 𝐻𝐻: �𝑥𝑥 ˙ ∈ 𝐹𝐹(𝑥𝑥, 𝑢𝑢) (𝑥𝑥, 𝑢𝑢) ∈ 𝐶𝐶 𝑥𝑥+ ∈ 𝐺𝐺(𝑥𝑥, 𝑢𝑢) (𝑥𝑥, 𝑢𝑢) ∈ 𝐷𝐷 (1) where 𝑥𝑥 ∈ 𝑅𝑅𝑛𝑛 represents the system state, 𝑢𝑢𝐶𝐶 ∈ 𝑅𝑅𝑚𝑚𝐶𝐶 denotes the continuous control input… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

35 extracted references · 34 canonical work pages

  1. [1]

    On the optimal cost and asymptotic stability in two -player zero-sum set-valued hybrid games

    Leudo, S.J., et al. "On the optimal cost and asymptotic stability in two -player zero-sum set-valued hybrid games." American Control Conference, 2024

    work page 2024

  2. [2]

    Hybrid Dynamical Systems: Modeling, Stability, and Robustness

    Goebel, R., et al. Hybrid Dynamical Systems: Modeling, Stability, and Robustness . Princeton University Press, 2012

    work page 2012

  3. [3]

    Game Theory and Multi -Agent Reinforcement Learning: From Nash Equilibria to Evolutionary Dynamics

    De La Fuente, Neil, and Guim Casadellà. "Game Theory and Multi -Agent Reinforcement Learning: From Nash Equilibria to Evolutionary Dynamics." arXiv preprint arXiv:2412.20523 (2024)

    arXiv 2024

  4. [4]

    Learning Two- agent Motion Planning Strategies from Generalized Nash Equilibrium for Model Predictive Control

    Kim, Hansung, et al. "Learning Two- agent Motion Planning Strategies from Generalized Nash Equilibrium for Model Predictive Control." arXiv preprint arXiv:2411.13983 (2024)

    work page arXiv 2024

  5. [5]

    Survey of containment control in multi- agent systems: concepts, communication, dynamics, and controller design, International Jthisnal of Systems Science, 2023

    work page 2023

  6. [6]

    Motion Planning for Hybrid Dynamical Systems

    Sanfelice, R.G. "Motion Planning for Hybrid Dynamical Systems." International J thisnal of Robotics Research, 2025

    work page 2025

  7. [7]

    Distributed State Estimation of Jointly Observable Linear Systems under Directed Switching Networks

    Sanfelice, R.G. "Distributed State Estimation of Jointly Observable Linear Systems under Directed Switching Networks." IEEE Transactions on Automatic Control, 2024

    work page 2024

  8. [8]

    Learning generalized Nash equilibria in multi- agent dynamical systems via extremum seeking control

    Grammatico, S., et al. "Learning generalized Nash equilibria in multi- agent dynamical systems via extremum seeking control." Automatica, 2021

    work page 2021

Show all 35 references
  1. [9]

    Centralized and Decentralized Event -Triggered Nash Equilibrium -Seeking Strategies for Heterogeneous Multi-Agent Systems

    Li, H., et al. "Centralized and Decentralized Event -Triggered Nash Equilibrium -Seeking Strategies for Heterogeneous Multi-Agent Systems." Mathematics, 2025

    2025

  2. [10]

    An introduction to event -triggered and self -triggered control

    Heemels, W.P.M.H., et al. "An introduction to event -triggered and self -triggered control." IEEE Conference on Decision and Control, 2012

    2012

  3. [11]

    Dynamic Event -triggered Control and Estimation: A Survey

    Xing, L., et al. "Dynamic Event -triggered Control and Estimation: A Survey." Machine Intelligence Research, 2021

    2021

  4. [12]

    Robust Synergistic Hybrid Feedback

    Sanfelice, R.G. "Robust Synergistic Hybrid Feedback." IEEE Transactions on Automatic Control, 2024

    2024

  5. [13]

    Pointwise Exponential Stability of State Consensus with Intermittent Communication

    Sanfelice, R.G. "Pointwise Exponential Stability of State Consensus with Intermittent Communication." IEEE Transactions on Automatic Control, 2024

    2024

  6. [14]

    Forward Invariance of Sets for Hybrid Dynamical Systems

    Sanfelice, R.G. "Forward Invariance of Sets for Hybrid Dynamical Systems." IEEE Transactions on Automatic Control, 2021

    2021

  7. [15]

    V erification and Control of Hybrid Systems: A Symbolic Approach

    Tabuada, P. V erification and Control of Hybrid Systems: A Symbolic Approach. Springer, 2009

    2009

  8. [16]

    Hybrid Dynamical Systems: An Introduction to Control and Verification

    Lygeros, J., et al. "Hybrid Dynamical Systems: An Introduction to Control and Verification." Foundations and Trends in Systems and Control, 2008

    2008

  9. [17]

    Consensus analysis of hybrid multiagent systems: A game-theoretic approach

    Chen, F., et al. "Consensus analysis of hybrid multiagent systems: A game-theoretic approach." IEEE Transactions on Cybernetics, 2019

    2019

  10. [18]

    Analysis and control of epidemics: A survey of spreading processes on complex networks

    Nowzari, C., et al. "Analysis and control of epidemics: A survey of spreading processes on complex networks." IEEE Control Systems Magazine, 2016

    2016

  11. [19]

    The complexity of computing a Nash equilibrium

    Daskalakis, C., et al. "The complexity of computing a Nash equilibrium." Communications of the ACM, 2009

    2009

  12. [20]

    Settling the complexity of computing two- player Nash equilibria

    Chen, X., et al. "Settling the complexity of computing two- player Nash equilibria." J thisnal of the ACM, 2009

    2009

  13. [21]

    A survey of computational complexity results in systems and control

    Blondel, V .D. and Tsitsiklis, J.N. "A survey of computational complexity results in systems and control." Automatica, 2000

    2000

  14. [22]

    Verification of hybrid systems via mathematical programming

    Bemporad, A. and Morari, M. "Verification of hybrid systems via mathematical programming." Hybrid Systems: Computation and Control, 1999

    1999

  15. [23]

    The complexity of computing a Nash equilibrium

    Daskalakis, C., et al. "The complexity of computing a Nash equilibrium." SIAM J thisnal on Computing, 2009

    2009

  16. [24]

    Settling the complexity of computing two-player Nash equilibria

    Chen, X., et al. "Settling the complexity of computing two-player Nash equilibria." ACM Symposium on Theory of Computing, 2006

    2006

  17. [25]

    Distributed Nash equilibrium seeking in aggregative games

    Grammatico, S. "Distributed Nash equilibrium seeking in aggregative games." IEEE Conference on Decision and Control, 2020

    2020

  18. [26]

    Event-triggered real-time scheduling of stabilizing control tasks

    Tabuada, P . "Event-triggered real-time scheduling of stabilizing control tasks." IEEE Transactions on Automatic Control, 2007

    2007

  19. [27]

    Dynamic triggering mechanisms for event -triggered control

    Girard, A. "Dynamic triggering mechanisms for event -triggered control." IEEE Transactions on Automatic Control, 2015

    2015

  20. [28]

    Event -triggered control systems under denial -of-service attacks

    Dolk, V .S., et al. "Event -triggered control systems under denial -of-service attacks." IEEE Transactions on Control of Network Systems, 2017

    2017

  21. [29]

    Distributed Nash Equilibrium Seeking Under Event -Triggered Mechanism

    Zhu, S., et al. "Distributed Nash Equilibrium Seeking Under Event -Triggered Mechanism." IEEE Transactions on Neural Networks and Learning Systems, 2021

    2021

  22. [30]

    Nash Equilibrium Seeking for Graphic Games With Dynamic Event -Triggered Mechanism

    Ye, M., et al. "Nash Equilibrium Seeking for Graphic Games With Dynamic Event -Triggered Mechanism." IEEE Transactions on Cybernetics, 2021

    2021

  23. [31]

    Learning generalized Nash equilibria in monotone games: A hybrid adaptive extremum seeking control approach

    Bianchi, M., et al. "Learning generalized Nash equilibria in monotone games: A hybrid adaptive extremum seeking control approach." IEEE Conference on Decision and Control, 2021

    2021

  24. [32]

    Learning generalized Nash equilibria in multi -agent dynamical systems via extremum seeking control

    Krilašević, S. and Grammatico, S. "Learning generalized Nash equilibria in multi -agent dynamical systems via extremum seeking control." Automatica, 2021

    2021

  25. [33]

    A Survey of Distributed Algorithms for Aggregative Games

    Yi, P., et al. "A Survey of Distributed Algorithms for Aggregative Games." IEEE/CAA J thisnal of Automatica Sinica, 2024

    2024

  26. [34]

    Tracking Control for Hybrid Systems With State -Triggered Jumps

    Sanfelice, R.G. "Tracking Control for Hybrid Systems With State -Triggered Jumps." IEEE Transactions on Automatic Control, 2013

    2013

  27. [35]

    Hybrid and Switched Systems: Modeling, Analysis, and Control

    Heemels, W.P.M.H. "Hybrid and Switched Systems: Modeling, Analysis, and Control." Eindhoven University of Technology, 2023

    2023

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.