Worst-case analysis of non-cooperative load balancing

DOI10.1007/s10479-014-1747-7zbMath1347.91072OpenAlexW2025784679MaRDI QIDQ291317

Olivier Brun, Balakrishna J. Prabhu

Publication date: 7 June 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1747-7

zbMATH Keywords

load balancingprice of anarchysymmetric gamesatomic games

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80)

Related Items (3)

Worst-case analysis of non-cooperative load balancing ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Inefficiency in stochastic queueing systems with strategic customers

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case analysis of non-cooperative load balancing
• Customer equilibrium and optimal strategies in Markovian queues in series
• The price of anarchy in an exponential multi-server
• A survey on networking games in telecommunications
• The Impact of Oligopolistic Competition in Networks
• Capacity allocation under noncooperative routing
• Game Theory in Wireless and Communication Networks
• Introduction to Queueing
• Competitive routing in networks with polynomial costs
• The price of anarchy is independent of the network topology

This page was built for publication: Worst-case analysis of non-cooperative load balancing