arXiv (All)
open access
A Fundamental Limit in Decentralized Decision-Making
In decentralized decision-making, several agents connected according to a network graph aim at solving a classification problem by collecting streaming observations. Due to decentralization, they run an iterative algorithm where, at each iteration, they can only exchange information locally with the
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
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Optimization without Future Compromises? Decentralized Coordination via Collective and Reinforcement Learning#1063786
- An Information Analysis of Iterative Algorithms for Network Utility Maximization and Strategic Games#1005562
- Strategic Centrality and the Emergence of Core-Periphery Networks#924246
- Strategic Centrality and the Emergence of Core-Periphery Networks#920015
Record · ID 984397
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