Selfish routing is a classical mathematical model of how self-interested users might route traffic through a congested network. The outcome of selfish routing is generally inefficient, in that it fails to optimize natural objective functions. The price of anarchy is a quantitative measure of this inefficiency. We survey recent work that analyzes the price of anarchy of selfish routing. We also ...

This paper examines the asymptotic behavior of the price of anarchy as a function of the total traffic inflow in nonatomic congestion games with multiple origin-destination pairs. We first show that the price of anarchy may remain bounded away from 1, even in simple three-link parallel networks with convex cost functions. On the other hand, empirical studies show that the price of anarchy is cl...

Price of anarchy, the performance ratio, which could characterize the loss of efficiency of the distributed supply chain management compared with the integrated supply chain management is discussed by utilizing newsvendor problem in single period which is well-known. In particular, some of remarkable distributed policies are handled, the performance ratios in each case which have been investiga...

The use of „anarchy‟ in international relations theory appears very different from its incarnations in political philosophy. Whilst realist scholars have used anarchy to describe a condition of absence of centralised political authority in which states wield differential power, political philosophers in the anarchist tradition have mounted a critique of the coercive and compulsory powers of sta...

This paper focuses on the design of cost sharing rules to optimize the efficiency of the resulting equilibria in cost sharing games with concave cost functions. Our analysis focuses on two well-studied measures of efficiency, termed the price of anarchy and price of stability, which provide worstcase guarantees on the performance of the (worst or best) equilibria. Our first result characterizes...

We consider a priority-based selfish routing model, where agents may have different priorities on a link. An agent with a higher priority on a link can traverse it with a smaller delay or cost than an agent with lower priority. This general framework can be used to model a number of different problems. The structural properties that lead to inefficiencies in routing choices appear different in ...