Selfish traffic allocation for server farms

DOI10.1145/509907.509952zbMath1192.68033OpenAlexW2075113319MaRDI QIDQ3579231

Piotr Krysta, Berthold Vöcking, Artur Czumaj

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/3319/1/WRAP_Cjumaz_Selfish_traffic.pdf

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (19)

Atomic routing games on maximum congestion ⋮ On spectrum sharing games ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ A network pricing game for selfish traffic ⋮ 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 ⋮ Connectivity and equilibrium in random games ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Tradeoffs in worst-case equilibria ⋮ The price of anarchy is independent of the network topology ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ The path player game ⋮ Non-cooperative tree creation ⋮ Selfish unsplittable flows

This page was built for publication: Selfish traffic allocation for server farms