arXiv (OAI Expanded)
open access
Data-Driven Spiking Control for Distributed $\varepsilon$-Nash Equilibrium Seeking
This paper studies how a feedback law synthesized directly from data can be realized by spiking control while retaining a game-theoretic performance guarantee. We consider distributed $\varepsilon$-Nash equilibrium (NE) seeking in network games played by linear dynamical agents with unknown models a
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
- Official Review · NEURIPS 2024#787157
- Theoretical Considerations of Potential-Based Reward Shaping for Multi-Agent Systems#638157
- Kyle meets time-inconsistency: a dynamic mean--variance informed trading problem#1143302
- The Robustness of Sequential Implementation under Information Perturbations#1104663
- Minimax Last-Iterate Convergence in Matrix Games with Observed Actions#1128916
Record · ID 1071431
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