arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2503.09684cond-mat.dis-nncond-mat.stat-mechphysics.soc-ph
收藏

通过随机可拥堵网络的交通中无知的益处

The benefit of ignorance for traffic through a random congestible network

Ohio State University(俄亥俄州立大学)

Alican Saray, Calvin Pozderac, Ari Josephson, Shravan Sripadhanallur Natarajan, Brian Skinner

AI总结:

本文提出随机混合可拥堵与不可拥堵链路的交通模型,定义“无知的代价”,证明少量不确定性可普遍改善自利路由,并存在使流量达到最优的无知水平。

摘要:

当交通经由一个易发生拥堵的网络进行路由时,个体用户出于自利所做的决策通常不会产生最优流量。这种差异由所谓的“无政府状态代价”(price of anarchy)来量化。本文研究当用户对网络中各链路的成本函数认识不确定时,自利用户产生的交通会变好还是变坏,并定义了一个并行概念,称为“无知的代价”(price of ignorance)。我们引入一个简单模型,其中快速、可拥堵的链路与缓慢、不可拥堵的链路在大型网络中随机混合,而用户在规划路线时,对于每条链路究竟由两种成本函数中的哪一种描述,只具有有限的不确定性。我们的关键发现之一是:无论网络构成如何,少量的用户无知都会普遍改善交通。此外,存在一个最优的无知水平,在我们的模型中,它使自利用户行为与最优状态相一致。模型的许多特征都可以通过解析方式理解,包括用户无知的最优水平,以及在快速链路渗流阈值附近存在的临界标度;在该阈值附近,用户无知的潜在收益最大。

英文摘要:

When traffic is routed through a network that is susceptible to congestion, the self-interested decisions made by individual users do not, in general, produce the optimal flow. This discrepancy is quantified by the so-called ``price of anarchy.'' Here we consider whether the traffic produced by self-interested users is made better or worse when users have uncertain knowledge about the cost functions of the links in the network, and we define a parallel concept that we call the ``price of ignorance.'' We introduce a simple model in which fast, congestible links and slow, incongestible links are mixed randomly in a large network and users plan their routes with finite uncertainty about which of the two cost functions describes each link. One of our key findings is that a small level of user ignorance universally improves traffic, regardless of the network composition. Further, there is an optimal level of ignorance which, in our model, causes the self-interested user behavior to coincide with the optimum. Many features of our model can be understood analytically, including the optimal level of user ignorance and the existence of critical scaling near the percolation threshold for fast links, where the potential benefit of user ignorance is greatest. We demonstrate that our qualitative conclusions apply also to networks with nonlinear cost functions, and we comment on the case of scale-free networks, where there is no direct analog of percolation physics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑