Graph-based distributed Nash equilibrium seeking for potential games

DOI10.1016/J.NAHS.2026.101750MaRDI QIDQ7354378zbMATH OpenFDO

Authors T. Sântejudean, V. S. Varma, Irinel-Constantin Morărescu, Lucian Buşoniu

Publication date 18 September 2026

Published in Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.NAHS.2026.101750

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Better-reply dynamics and global convergence to Nash equilibrium in aggregative games
• Convergence analysis of distributed generalized Nash equilibria seeking algorithm with asynchrony and delays
• Convergence time to Nash equilibrium in load balancing
• Distributed Subgradient Methods for Multi-Agent Optimization
• From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Non-cooperative games
• Noncooperative game theory. An introduction for engineers and computer scientists
• On best-response dynamics in potential games
• On gradient-based learning in continuous games
• On the Characterization of Local Nash Equilibria in Continuous Games
• Potential Game Theory
• Potential games
• Stateless distributed gradient descent for positive linear programs
• Time- and event-triggered communication for multi-agent systems. I: General framework
• Uniform global asymptotic stability of differential inclusions
• Weighted and near weighted potential games with application to game theoretic control

This page was built for publication: Graph-based distributed Nash equilibrium seeking for potential games

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