Worst-case analysis of non-cooperative load balancing
From MaRDI portal
Publication:291317
DOI10.1007/S10479-014-1747-7zbMATH Open1347.91072OpenAlexW2025784679MaRDI QIDQ291317FDOQ291317
Olivier Brun, Balakrishna 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
Recommendations
- Noncooperative load balancing in distributed systems
- On the analysis of randomized load balancing schemes
- scientific article; zbMATH DE number 2226839
- Improved analysis of deterministic load-balancing schemes
- Improved analysis of deterministic load-balancing schemes
- scientific article
- Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems
- Steady-state analysis of load-balancing algorithms in the sub-Halfin-Whitt regime
- Publication:4945781
Programming involving graphs or networks (90C35) Applications of game theory (91A80) Noncooperative games (91A10) Games involving graphs (91A43)
Cites Work
- The price of anarchy in an exponential multi-server
- A survey on networking games in telecommunications
- Title not available (Why is that?)
- The price of anarchy is independent of the network topology
- The Impact of Oligopolistic Competition in Networks
- Title not available (Why is that?)
- Competitive routing in networks with polynomial costs
- Worst-case analysis of non-cooperative load balancing
- Capacity allocation under noncooperative routing
- Customer equilibrium and optimal strategies in Markovian queues in series
- Game Theory in Wireless and Communication Networks
- Introduction to Queueing
Cited In (4)
This page was built for publication: Worst-case analysis of non-cooperative load balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291317)
