arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.6496cs.GTmath.OC
收藏

具有仿射代价函数的多类网络平衡问题的求解

Computing solutions of the multiclass network equilibrium problem with affine cost functions

Frédéric Meunier, Thomas Pradeau

摘要:

我们考虑一个图上的非原子拥塞博弈,有几类玩家。每个参与者都希望以最小的成本从其原点顶点到达其目的地顶点,并且给定类的所有参与者都具有相同的特征:每个弧上的成本函数和原点-目的地对。在一定的条件下,已知存在纳什均衡,但多类情形下均衡的计算对于一般函数是一个公开问题。我们考虑的具体情况下,成本函数是仿射。我们表明,这个问题是多项式可解的顶点数和类的数量是固定的。特别是,它表明,具有固定数量的类的并行链接的情况下是多项式可解的。在一个更实际的方面,我们提出了一个扩展的Lemke算法能够解决这个问题。

英文摘要:

We consider a nonatomic congestion game on a graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origin-destination pair. Under some mild conditions, it is known that a Nash equilibrium exists, but the computation of an equilibrium in the multiclass case is an open problem for general functions. We consider the specific case where the cost functions are affine. We show that this problem is polynomially solvable when the number of vertices and the number of classes are fixed. In particular, it shows that the parallel-link case with a fixed number of classes is polynomially solvable. On a more practical side, we propose an extension of Lemke's algorithm able to solve this problem.

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

↑