论文标题
衣柜平衡的敏感性：重新审视
Sensitivity of Wardrop Equilibria: Revisited
论文作者
论文摘要
对于单商品网络，无政府状态的价格上涨的限制为$（1+ε）^p $，当旅行需求增加$ 1+ε$时，延迟功能最多是$ p $的多项式学位。我们表明，相同的上限也适用于多商品网络，并提供下限。
For single-commodity networks, the increase of the price of anarchy is bounded by a factor of $(1+ε)^p$ from above, when the travel demand is increased by a factor of $1+ε$ and the latency functions are polynomials of degree at most $p$. We show that the same upper bound holds for multi-commodity networks and provide a lower bound as well.
