For single-commodity networks, the increase of the price of anarchy is bounded by a factor of \((1+\varepsilon )^p\) from above, when the travel demand is increased by a factor of \(1+\varepsilon \) 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.

中文翻译：

---

重新审视wardrop平衡的敏感性

对于单一商品网络，混乱的价格的增加是通过一个因子界定\（（1 + \ varepsilon）^ P \）从上面，当旅游需求增加的一个因素\（1+ \ varepsilon \）和潜伏期函数最多是度的多项式p。我们表明，相同的上限适用于多商品网络，并且还提供了下限。