Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers
Abstract:Recent machine learning research has increasingly focused on equilibrium analysis in non-cooperative games rather than solely on optimal solutions. Many such problems involve shared constraints and can be formulated as Generalized Nash Equilibrium Problems (GNEPs). For strongly monotone games, existing methods compute consensus-based variational GNEs (v-GNEs) by exchanging Lagrange multipliers. We propose a fully distributed continuous-time algorithm for shared linear equality constraints that converges without multiplier exchange and reaches any GNE, reducing communication overhead and improving privacy. Discrete-time schemes are also provided, and the method is validated on a multi-robot placement task.
| Comments: | 6 pages, 3 figures. Published in the 2026 American Control Conference (ACC), pp. 3633--3638 |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Science and Game Theory (cs.GT); Multiagent Systems (cs.MA); Robotics (cs.RO) |
| Cite as: | arXiv:2608.29388 [cs.LG] |
| (or arXiv:2608.29388v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2608.29388
arXiv-issued DOI via DataCite (pending registration)
|
|
| Journal reference: | 2026 American Control Conference (ACC), pp. 3633--3638, 2026 |
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
Current browse context:
References & Citations
Bookmark
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
AhaBench: Do Agents Learn from Prior Experience? A Benchmark for Long-Horizon Continual Learning
Sep 10
-
When Do Options Help? Policy Necrosis and Redundant Coverage in Option-Critic
Sep 10
-
Multi-granularity Adaptive Hypergraph Representation Learning via Granular-ball
Sep 10
-
Capsule Lens: Locating and Tracking Concept Geometry in Model Representations
Sep 10
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.