← 研踪 PaperTrailarXiv:2609.06351 · v2
A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
首次提交 2026-09-06 11:04
版本更新 2026-11-13 09:37
雷达观测 2026-11-17 04:57
摘要
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.
作者备注:32 pages, 6 figures. Manuscript source and complete reproduction materials are available at https://github.com/ANRGUSC/TINA
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-13 09:37 · 最新观测版本
A Theory of Information Architecture for Networked Decisions: Freshness, Locality, and Coordination
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.
查看此版本解读 →查看此版本原文 ↗