arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.07808cs.GTcs.CCmath.OC
收藏

瞬时动态均衡流的有限时间组合算法

A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows

Lukas Graf, Tobias Harks

AI总结:

本文提出首个有限时间组合算法计算Vickrey瓶颈模型中的瞬时动态均衡,并证明计算具有自然性质的均衡是NP困难的。

摘要:

瞬时动态均衡(IDE)是动态交通分配中的一个标准博弈论概念,其中个体流粒子短视地选择当前通往目的地的最短路径。我们在Vickrey瓶颈模型中分析IDE,在该模型中,沿路径的当前行驶时间由物理行驶时间加上沿路径所有队列的等待时间之和组成。尽管IDE已被研究数十年,但关于均衡计算和复杂性的几个基本问题仍未得到充分理解。特别是,所有存在性结果和计算方法都基于不动点定理和数值离散化方案,迄今为止尚无已知的精确有限时间算法用于均衡计算。作为我们的主要结果,我们证明了一种自然扩展算法只需有限多个阶段即可收敛,从而产生了第一个计算IDE的有限时间组合算法。我们通过若干困难性结果补充了这一结果,表明计算具有自然性质的IDE是NP困难的。

英文摘要:

Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic concept in dynamic traffic assignment in which individual flow particles myopically select en route currently shortest paths towards their destination. We analyze IDE within the Vickrey bottleneck model, where current travel times along a path consist of the physical travel times plus the sum of waiting times in all the queues along a path. Although IDE have been studied for decades, several fundamental questions regarding equilibrium computation and complexity are not well understood. In particular, all existence results and computational methods are based on fixed-point theorems and numerical discretization schemes and no exact finite time algorithm for equilibrium computation is known to date. As our main result we show that a natural extension algorithm needs only finitely many phases to converge leading to the first finite time combinatorial algorithm computing an IDE. We complement this result by several hardness results showing that computing IDE with natural properties is NP-hard.

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

↑