The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear
latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ …
latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ …
System-optimal routing of traffic flows with user constraints in networks with congestion
The design of route guidance systems faces a well-known dilemma. The approach that
theoretically yields the system-optimal traffic pattern may discriminate against some users in …
theoretically yields the system-optimal traffic pattern may discriminate against some users in …
[BOOK][B] Optimal design of queueing systems
S Stidham Jr - 2009 - taylorfrancis.com
The First Comprehensive Book on the SubjectFocusing on the underlying structure of a
system, Optimal Design of Queueing Systems explores how to set the parameters of a …
system, Optimal Design of Queueing Systems explores how to set the parameters of a …
On the severity of Braess's paradox: Designing networks for selfish users is hard
T Roughgarden - Journal of Computer and System Sciences, 2006 - Elsevier
We consider a directed network in which every edge possesses a latency function that
specifies the time needed to traverse the edge given its congestion. Selfish, noncooperative …
specifies the time needed to traverse the edge given its congestion. Selfish, noncooperative …
Approximating congestion+ dilation in networks via" Quality of Routing” Games
A classic optimization problem in network routing is to minimize C+ D, where C is the
maximum edge congestion and D is the maximum path length (also known as dilation). The …
maximum edge congestion and D is the maximum path length (also known as dilation). The …
On the price of anarchy and stability of correlated equilibria of linear congestion games
We consider the price of stability for Nash and correlated equilibria of linear congestion
games. The price of stability is the optimistic price of anarchy, the ratio of the cost of the best …
games. The price of stability is the optimistic price of anarchy, the ratio of the cost of the best …
Fast, fair, and efficient flows in networks
We study the problem of minimizing the maximum latency of flows in networks with
congestion. We show that this problem is NP-hard, even when all arc latency functions are …
congestion. We show that this problem is NP-hard, even when all arc latency functions are …
The multi-class, multi-criterion traffic equilibrium and the efficiency of congestion pricing
We consider the effect of the so-called second-best tolls on the price of anarchy of the traffic
equilibrium problem where there are multiple classes of users with a discrete set of values of …
equilibrium problem where there are multiple classes of users with a discrete set of values of …
On the inefficiency of equilibria in congestion games
We present a short geometric proof for the price of anarchy results that have recently been
established in a series of papers on selfish routing in multicommodity flow networks. This …
established in a series of papers on selfish routing in multicommodity flow networks. This …
The “price of anarchy” under nonlinear and asymmetric costs
G Perakis - Mathematics of Operations Research, 2007 - pubsonline.informs.org
In this paper we characterize the “price of anarchy,” ie, the inefficiency between user and
system optimal solutions, when costs are nonseparable, asymmetric and nonlinear …
system optimal solutions, when costs are nonseparable, asymmetric and nonlinear …