Worst-case analysis of non-cooperative load balancing
From MaRDI portal
(Redirected from Publication:291317)
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; zbMATH DE number 4094771
- 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
Cites work
- A course in game theory.
- A survey on networking games in telecommunications
- Capacity allocation under noncooperative routing
- Competitive routing in networks with polynomial costs
- Customer equilibrium and optimal strategies in Markovian queues in series
- Game Theory in Wireless and Communication Networks
- Performance modeling and design of computer systems. Queueing theory in action
- The impact of oligopolistic competition in networks
- The price of anarchy in an exponential multi-server
- The price of anarchy is independent of the network topology
- Worst-case analysis of non-cooperative load balancing
- Worst-case equilibria
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)