当前位置: X-MOL 学术Math. Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The price of anarchy in routing games as a function of the demand
Mathematical Programming ( IF 2.7 ) Pub Date : 2021-09-08 , DOI: 10.1007/s10107-021-01701-7
Roberto Cominetti 1 , Valerio Dose 2 , Marco Scarsini 3
Affiliation  

The price of anarchy has become a standard measure of the efficiency of equilibria in games. Most of the literature in this area has focused on establishing worst-case bounds for specific classes of games, such as routing games or more general congestion games. Recently, the price of anarchy in routing games has been studied as a function of the traffic demand, providing asymptotic results in light and heavy traffic. The aim of this paper is to study the price of anarchy in nonatomic routing games in the intermediate region of the demand. To achieve this goal, we begin by establishing some smoothness properties of Wardrop equilibria and social optima for general smooth costs. In the case of affine costs we show that the equilibrium is piecewise linear, with break points at the demand levels at which the set of active paths changes. We prove that the number of such break points is finite, although it can be exponential in the size of the network. Exploiting a scaling law between the equilibrium and the social optimum, we derive a similar behavior for the optimal flows. We then prove that in any interval between break points the price of anarchy is smooth and it is either monotone (decreasing or increasing) over the full interval, or it decreases up to a certain minimum point in the interior of the interval and increases afterwards. We deduce that for affine costs the maximum of the price of anarchy can only occur at the break points. For general costs we provide counterexamples showing that the set of break points is not always finite.



中文翻译:

作为需求函数的路由游戏中的无政府状态价格

无政府状态的代价已成为衡量博弈均衡效率的标准。该领域的大多数文献都集中在为特定类别的游戏建立最坏情况的界限,例如路由游戏或更一般的拥塞游戏。最近,路由游戏中的无政府状态的价格作为流量需求的函数进行了研究,在轻和重流量下提供渐近结果。本文的目的是研究需求中间区域的非原子路由博弈中的无政府状态价格。为了实现这一目标,我们首先为一般平滑成本建立 Wardrop 均衡和社会最优的一些平滑特性。在仿射成本的情况下,我们表明均衡是分段线性的,断点位于活动路径集变化的需求水平。我们证明了这种断点的数量是有限的,尽管它可以随着网络的规模呈指数增长。利用均衡和社会最优之间的标度律,我们推导出了最优流量的类似行为。然后我们证明,在断点之间的任何区间内,无政府状态的价格都是平滑的,它要么在整个区间内单调(下降或上升),要么下降到区间内部的某个最小点,然后上升。我们推断,对于仿射成本,无政府状态的最大价格只能发生在断点处。对于一般成本,我们提供了反例,表明断点集并不总是有限的。利用均衡和社会最优之间的标度律,我们推导出了最优流量的类似行为。然后我们证明,在断点之间的任何区间内,无政府状态的价格都是平滑的,它要么在整个区间内单调(下降或上升),要么下降到区间内部的某个最小点,然后上升。我们推断,对于仿射成本,无政府状态的最大价格只能发生在断点处。对于一般成本,我们提供了反例,表明断点集并不总是有限的。利用均衡和社会最优之间的标度律,我们推导出了最优流量的类似行为。然后我们证明,在断点之间的任何区间内,无政府状态的价格都是平滑的,它要么在整个区间内单调(下降或上升),要么下降到区间内部的某个最小点,然后上升。我们推断,对于仿射成本,无政府状态的最大价格只能发生在断点处。对于一般成本,我们提供了反例,表明断点集并不总是有限的。或者它下降到区间内部的某个最小值点,然后增加。我们推断,对于仿射成本,无政府状态的最大价格只能发生在断点处。对于一般成本,我们提供了反例,表明断点集并不总是有限的。或者它下降到区间内部的某个最小值点,然后增加。我们推断,对于仿射成本,无政府状态的最大价格只能发生在断点处。对于一般成本,我们提供了反例,表明断点集并不总是有限的。

更新日期:2021-09-09
down
wechat
bug