跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+816新增论文
+642其中 AI 相关
+95已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 12:54 — 2026-11-21 12:54(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v2arXiv:2609.06351

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

Scott Moeller, Bhaskar Krishnamachari

原文摘要

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.

eess.SY · cs.NI · math.OC