The price of selfish routing

DOI10.1007/s00453-006-0056-1zbMath1137.91007OpenAlexW2070975056WikidataQ126269699 ScholiaQ126269699MaRDI QIDQ996709

Marios Mavronicolas, Paul G. Spirakis

Publication date: 19 July 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0056-1

Mathematics Subject Classification ID

Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Traffic problems in operations research (90B20)

Related Items (28)

Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ The complexity of welfare maximization in congestion games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Atomic routing games on maximum congestion ⋮ Selfish Vector Packing ⋮ A Glimpse at Paul G. Spirakis ⋮ A Selective Tour Through Congestion Games ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Selfish bin coloring ⋮ The price of anarchy on uniformly related machines revisited ⋮ On equilibria for ADM minimization games ⋮ Minimizing expectation plus variance ⋮ Tight bounds for selfish and greedy load balancing ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ A bin packing game with cardinality constraints under the best cost rule ⋮ Selfish vector packing ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ A new model for selfish routing ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ Facets of the fully mixed Nash equilibrium conjecture ⋮ Facets of the Fully Mixed Nash Equilibrium Conjecture ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Parametric packing of selfish items and the subset sum algorithm

This page was built for publication: The price of selfish routing