Backend
A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
arXiv eess.SY0 views
arXiv:2609.06351v2 Announce Type: replace Abstract: A broader view of a network can help agents coordinate, but collecting that view takes time. When is a fresh local observation more useful than an older view of the whole network, and when should an agent look only partway across it? We study agents that repeatedly minimize a shared quadratic cost in an environment that evolves independently of their actions. An information architecture specifies what each agent observes and how old those observations are. Each agent uses a synchronized neighborhood snapshot, so extending its scope also ages the nearby readings used in the decision. We assume that the optimal action with complete information is affine in the state, and that the conditional mean of the current state equals the old state scaled by a common exponential decay factor. Using the classical Marschak--Radner decomposition, we derive the delay threshold beyond which fresh local information outperforms a complete but older global view. This comparison allows non-Gaussian states and nonlinear decision rules. We then determine how far an agent should look by balancing the benefit of additional observations against their greater age. In a Gaussian spatial model on a line, we derive the optimal observation radius: looking beyond the local node pays only when information travels more than twice the spatial correlation length in one coherence time. The preferred information architecture also depends on the decision being made. On a fixed 64-node ring, increasing only the reach of the decision weights from 0.7 to 6 hops shifts the optimal observation radius from one to five hops.
Source:https://arxiv.org/abs/2609.06351PreviousRCOA Extension and ApplicationsNextContract-Based Decomposition of Temporal Logic Specifications for Networked Systems under Arbitrary Partitions
Related posts

Dreame X50 Ultra: designing a Shopify buying journey around fit, bundles and payment conditions
0dev.to JavaScript
Connect Four in 86 lines: how I coded the rules for a multiplayer browser game
0dev.to JavaScript
From Prompt to Production: Architectural Deep‑Dive into MIT’s “How to Make Almost Anything” Framework
0dev.to Rust
PRISM: Preference-based Reward and Uncertainty-Integrated Synthesis Minimization for RTL PPA Optimization
0arXiv cs.SE
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA