Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs

DOI10.1016/J.AUTOMATICA.2025.112816MaRDI QIDQ6851054zbMATH OpenFDO

Authors Jialing Zhou, Guanghui Wen, Yuezu Lv, Xinlei Yi, Tao Yang, Karl Henrik Johansson

Publication date 27 February 2026

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2025.112816

zbMATH Keywords

directed graphdistributed resource allocationhard balance constraintNash equilibrium seekingresource allocation game

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Equilibrium refinements (91A11) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Multi-agent systems (93A16)

Cites work

• A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
• A Linearly Convergent Distributed Nash Equilibrium Seeking Algorithm for Aggregative Games
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Distributed Consensus of Second-Order Multi-Agent Systems With Heterogeneous Unknown Inertias and Control Gains Under a Directed Graph
• Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach
• Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
• Distributed resource allocation over multiple interacting coalitions: a game-theoretic approach
• Distributed resource allocation over random networks based on stochastic approximation
• Distributed resource allocation with binary decisions via Newton-like neural network dynamics
• Eigenvalue inequalities and equalities
• Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• Input–Output Performance of Linear–Quadratic Saddle-Point Algorithms With Application to Distributed Resource Allocation Problems
• Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
• Nash equilibrium seeking in N-coalition games via a gradient-free method
• Nonlinear Programming
• On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
• Optimal scaling of a gradient method for distributed resource allocation
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms

This page was built for publication: Distributed Nash equilibrium computation in multi-group resource allocation games over digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851054)