Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 21 min ago
PreprintarXiv licencearXiv

A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination

Abstract

Networked systems face a tradeoff between the scope of the information behind a decision and its freshness: a broader view of the system supports better coordination, but assembling and communicating it takes time, so it arrives older. We study this tradeoff for a team of agents that repeatedly choose actions to minimize a shared quadratic cost driven by an environment that evolves on its own, unaffected by the agents' actions. An information architecture specifies what each agent observes, from where, and with what delay; we measure an architecture by the cost it loses relative to a decision made with complete, current information. We first compare fresh local observations with a complete but delayed global view. When every component of the environment decorrelates at a common exponential rate, this comparison reduces to a closed-form threshold on the ratio of delay to coherence time. We then study intermediate architectures in which each agent acts on a time-aligned, and therefore older, snapshot of a wider neighborhood. The optimal neighborhood radius occurs where the marginal value of added scope equals the marginal cost of lost freshness. In a canonical spatial model, this radius is set by the spatial-correlation, decision-relevance, and temporal-propagation lengths. Throughout, architecture performance is governed by the predictability of the optimal decision rather than of the raw state.

Related

  1. Networked Admissibility-Preserving Control for Directed Safe Coordination
    Abhinav Sinha, Lohitvel Gopikannan, Shashi Ranjan Kumar
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsarXiv
  2. An Information Freshness-Based Method for Quantum Bayesian Networks in the Consensus-Reaching Process Under Relative Deprivation
    Huagang Tong, Sucheng Fan, Jingzhi Li
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref
  3. Adaptive Information Coordination for Context-Aware International Event Forecasting with Temporal Knowledge Graphs
    Yunbo Zhang, Jun Wu, Yu Wang +3
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. Semantic Freshness Optimal Sampling and Transmission for Gossiping Receivers
    Irtiza Hasan, Ahmed Arafa
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Quiver Semistability and Structured Kalman Decompositions for Networked Linear Dynamical Systems
    Kazuo Murota, Tasuku Soma
    arXivPreprintarXiv licenceFull textAlgebra & number theoryOptimisation & controlarXiv
BibTeX
@misc{moeller2026theory,
  title = {{A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination}},
  author = {Scott Moeller and Bhaskar Krishnamachari},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.06351},
  eprint = {2609.06351},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.06351},
}
RIS
TY  - UNPB
TI  - A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
AU  - Scott Moeller
AU  - Bhaskar Krishnamachari
PY  - 2026
DA  - 2026/09/06
PB  - arXiv
DO  - 10.48550/arxiv.2609.06351
UR  - https://arxiv.org/abs/2609.06351
AB  - Networked systems face a tradeoff between the scope of the information behind a decision and its freshness: a broader view of the system supports better coordination, but assembling and communicating it takes time, so it arrives older. We study this tradeoff for a team of agents that repeatedly choose actions to minimize a shared quadratic cost driven by an environment that evolves on its own, unaffected by the agents' actions. An information architecture specifies what each agent observes, from where, and with what delay; we measure an architecture by the cost it loses relative to a decision made with complete, current information. We first compare fresh local observations with a complete but delayed global view. When every component of the environment decorrelates at a common exponential rate, this comparison reduces to a closed-form threshold on the ratio of delay to coherence time. We then study intermediate architectures in which each agent acts on a time-aligned, and therefore older, snapshot of a wider neighborhood. The optimal neighborhood radius occurs where the marginal value of added scope equals the marginal cost of lost freshness. In a canonical spatial model, this radius is set by the spatial-correlation, decision-relevance, and temporal-propagation lengths. Throughout, architecture performance is governed by the predictability of the optimal decision rather than of the raw state.
ER  -