arXiv (OAI Expanded)
open access
Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers
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, exist
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fully Distributed GNE Algorithms for Multi-Robot Placement without Consensus on Multipliers#794183
- Decentralized Multi-Robot Exploration with Probabilistic Peer Intent and Multi-hop Plan Propagation#1037409
- Lecture Notes in Computer Science(LNCS, volume 16057), Lecture Notes in Artificial Intelligence (LNAI), Artificial General Intelligence-2025, 18th International Conference, AGI 2025, Reykjavic, Iceland, August 10–13, 2025, Proceedings, Part I#723837
- Multi-objective node placement optimization in multiplex 6G wireless networks using quantum-inspired evolutionary algorithms.#465412
- A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
Record · ID 790164
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive