The price of selfish routing

DOI10.1007/s00453-006-0056-1zbMath1137.91007MaRDI 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

91A10: Noncooperative games

68M10: Network design and communication in computer systems

91A43: Games involving graphs

90B20: Traffic problems in operations research

Related Items

Facets of the Fully Mixed Nash Equilibrium Conjecture, 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, Extending the notion of rationality of selfish agents: second order Nash equilibria, Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy, Tight bounds for selfish and greedy load balancing, The structure and complexity of Nash equilibria for a selfish routing game, Atomic routing games on maximum congestion, 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, Facets of the fully mixed Nash equilibrium conjecture, Designing fast converging cost sharing methods for multicast transmissions, The cost of selfishness for maximizing the minimum load on uniformly related machines, On equilibria for ADM minimization games, The complexity of welfare maximization in congestion games, Bottleneck Congestion Games with Logarithmic Price of Anarchy