arXiv (All)
open access
Tracking-based distributed equilibrium seeking for aggregative games
We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent, (i) the projected pseudo-gradient descent and (ii) a tracking mechanism to loc
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
- Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies#821391
- Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees#999543
- Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes#319653
- Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs#665588
- Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs#664088
Record · ID 1000436
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