网络代价;无政府的代价 网络释义
这是lecture note里面的介绍,但是是这章大后期了 POA (price of anarchy)就是在equilibrium情况下总cost和最小cost的比值。(这个东西很有意义 是因为在没有任何管理的情况下,并不是所有的情况都会发生,每个流量都会前往让自己cost最小的情况,而不是随机的,所以是合理的设定) 当前的例子,equilibrium 是上边走1/2...
Price of Anarchy 来自 Springer 喜欢 0 阅读量: 127 作者: G Christodoulou 摘要: Synonyms Coordination ratio Years and Authors of Summarized Original Work 2005; Koutsoupias Problem Definition The price of anarchy captures the lack of coordination in systems where users are selfish and may have ...
The price of anarchy The researchers borrowed a concept from game theory known as the "price of anarchy," which they defined as "the loss of welfare due to selfish rerouting compared with the policy-driven coordination." [sidebar] Juanes and colleagues modeled the epidemic problem as two scenar...
Most of us prefer to commute by the shortest route available, without taking into account the traffic congestion that we cause for others. Many networks, including computer networks, suffer from some type of this "selfish routing." In Selfish Routing and the Price of Anarchy, Tim Roughgarden st...
What is the price of anarchy?Technically,in transportation engineering,the price of anarchy describes the difference between what happens when every driver selfishly picks the fastest route and what the socially optimal traffic outcome would be.In the pre-mobile-app days,drivers'selfishness was ...
The Price of Anarchy is a widely adopted measure of the worst-case loss (relative to optimum) in system performance (maximum latency) incurred in a Nash equilibrium. In this work, we present a comprehensive collection of bounds on Price of Anarchy for the model of restricted parallel links ...
anarchy,theworst-possibleratiobetweenthetotallatencyofaNashequilibriumandofanoptimalroutingofthetraffic.Weshowthepriceofanarchyisdeterminedonlybythesimplestofnetworks.Specifically,weprovethatunderweakhypothesesontheclassofallowableedgelatencyfunctions,theworst-caseratiobetweenthetotallatencyofaNashequilibriumandofa...
We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related facility location problem called the k-facility location problem. As a result, we show that the k-facility location problem has a locality gap of 5. This result is of...
Society, therefore, has to pay a price of anarchy for the lack of coordination among its members. Here we assess this price of anarchy by analyzing the travel times in road networks of several major cities. Our simulation shows that uncoordinated drivers possibly waste a considerable amount of ...