也就是说，POA越大，意味着纳什均衡解中差的那一面越差。
PoA是economics和game theory里的概念 PoA =Price of Anarchy Anarchy = 无政府主义、混乱 如果不要中心...
网络代价;无政府的代价 网络释义
The price of anarchy provides the means to quantify the efficiency of Nash equilibria, and is defined as the ratio between the worst-case value of the game achieved by a Nash equilibrium (in our setting there is a unique one) and the social optimum. We prove that as the number of ...
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...
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processor-sharing at each server. The performance criterion is taken to be the weighted mean ...
Theoretical upper bounds for price of anarchy have been calculated in previous studies. We present an empirical analysis for the price of anarchy for congested transportation networks; different network sizes and demand levels are considered for each network. We obtain a maximum price of anarchy for...
Bounding the price of anarchy (PoA), which quantifies the degradation in the quality of outcomes in a (pure) Nash equilibrium of a game, is one of the fundamental questions in computational game theory. However, for a large class of games, a pure NE may not always exist and hence a ...
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processor-sharing at each server. The performance criterion is taken to be the weighted mean ...