Selfish Routing with Oblivious Users

DOI10.1007/978-3-540-72951-8_25zbMATH Open1201.68018OpenAlexW1831799901MaRDI QIDQ5425980FDOQ5425980

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

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

zbMATH Keywords

price of anarchyselfish routingoblivious users

Mathematics Subject Classification ID

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

Cited In (13)

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

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)