Selfish Routing with Oblivious Users

DOI10.1007/978-3-540-72951-8_25MaRDI QIDQ5425980zbMATH OpenOpenAlexFDO

Authors George Karakostas, Taeyon Kim, Anastasios Viglas, Hao Xia

Publication date 15 November 2007

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72951-8_25

zbMATH Keywords

oblivious usersprice of anarchyselfish routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Programming involving graphs or networks (90C35)

Recommendations

• How bad is selfish routing?
• A class of selfish routing with oblivious agents
• The price of selfish routing
• The price of selfish routing
• The price of anarchy is independent of the network topology

Cited in

(13)

• Selfish routing with incomplete information
• How bad is selfish routing?
• When Ignorance Helps: Graphical Multicast Cost Sharing Games
• Social context congestion games
• Routing selfish unsplittable traffic
• The Value of Information in Selfish Routing
• Algorithms and Computation
• A class of selfish routing with oblivious agents
• Nonadaptive Selfish Routing with Online Demands
• Reconciling selfish routing with social good
• The impact of social ignorance on weighted congestion games
• When ignorance helps: graphical multicast cost sharing games
• Equilibria for networks with malicious users

This page was built for publication: Selfish Routing with Oblivious Users

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425980)