arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.3794cs.GTcs.DS
收藏

均衡路径的网络改进问题

The Network Improvement Problem for Equilibrium Routing

Umang Bhaskar, Katrina Ligett, Leonard J. Schulman

摘要:

在路由博弈中,代理人通过网络选择他们的路由,以最大限度地减少自己的延迟。在路由博弈中,网络设计者主要关心的是均衡时的平均代理延迟。控制这种平均延迟的许多方法受到了极大的关注,包括网络收费、Stackelberg路由和边缘去除。一个可以说具有更大实际意义的相关方法是对网络边缘的改进进行投资,这样,对于给定的投资预算,改进后的网络在平衡时的平均延迟最小化。这个问题已经得到了相当大的关注,在文献中的运输研究和一些不同的算法进行了研究。据我们所知,这些工作都不能保证任何多项式时间算法的输出质量。我们研究了这个问题的模型在交通研究文献中介绍,并提出了硬度的结果和算法,获得近最佳的性能保证。- 我们首先表明,一个简单的算法获得良好的近似保证的问题。尽管它的简单性,我们表明,仿射延迟的近似比4/3的算法不能得到改善。- 为了获得更好的结果,我们考虑限制拓扑。对于由具有仿射延迟函数的平行路组成的图,我们给出了一个最优算法。然而,对于由一系列平行链接组成的图,我们证明了这个问题是弱NP-困难的。- 最后,我们考虑了串并联图中的问题,并给出了这种情况下的FPTAS。因此,我们的工作形式化的直觉,交通研究人员认为,网络的改善问题是困难的,并提出了拓扑依赖的算法,有可证明的紧近似保证。

英文摘要:

In routing games, agents pick their routes through a network to minimize their own delay. A primary concern for the network designer in routing games is the average agent delay at equilibrium. A number of methods to control this average delay have received substantial attention, including network tolls, Stackelberg routing, and edge removal. A related approach with arguably greater practical relevance is that of making investments in improvements to the edges of the network, so that, for a given investment budget, the average delay at equilibrium in the improved network is minimized. This problem has received considerable attention in the literature on transportation research and a number of different algorithms have been studied. To our knowledge, none of this work gives guarantees on the output quality of any polynomial-time algorithm. We study a model for this problem introduced in transportation research literature, and present both hardness results and algorithms that obtain nearly optimal performance guarantees. - We first show that a simple algorithm obtains good approximation guarantees for the problem. Despite its simplicity, we show that for affine delays the approximation ratio of 4/3 obtained by the algorithm cannot be improved. - To obtain better results, we then consider restricted topologies. For graphs consisting of parallel paths with affine delay functions we give an optimal algorithm. However, for graphs that consist of a series of parallel links, we show the problem is weakly NP-hard. - Finally, we consider the problem in series-parallel graphs, and give an FPTAS for this case. Our work thus formalizes the intuition held by transportation researchers that the network improvement problem is hard, and presents topology-dependent algorithms that have provably tight approximation guarantees.

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

↑