Selfish load balancing
From MaRDI portal
Recommendations
Cited in
(52)- Tight Bounds for Selfish and Greedy Load Balancing
- Reducing price of anarchy of selfish task allocation with more selfishness
- On Submodular Search and Machine Scheduling
- Smoothed performance guarantees for local search
- Performance guarantees of jump neighborhoods on restricted related parallel machines
- Selfish load balancing for jobs with favorite machines
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Efficiency of dual equilibria in selfish task allocation to selfish machines
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Two-group knapsack game
- Symmetry exploitation for online machine covering with bounded migration
- Concurrent imitation dynamics in congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- Colocating tasks in data centers using a side-effects performance model
- Tighter price of anarchy for selfish task allocation on selfish machines
- Tight bounds for selfish and greedy load balancing
- Strong stability of Nash equilibria in load balancing games
- Cost-sharing scheduling games on restricted unrelated machines
- Efficiency analysis with respect to the unit cost objectives in scheduling games
- Surrogate optimization for \(p\)-norms
- Load rebalancing games in dynamic systems with migration costs
- The strong price of anarchy of linear bottleneck congestion games
- Coordination mechanisms on unrelated machines with arbitrary priority lists
- Convergence of best-response dynamics in games with conflicting congestion effects
- Selfish Traffic Allocation for Server Farms
- Distributed selfish load balancing on networks
- Project games
- Selfish Load Balancing Under Partial Knowledge
- Game-theoretic static load balancing for distributed systems
- Promoting cooperation in selfish computational grids
- Machine load balancing game with linear externalities
- scientific article; zbMATH DE number 2156269 (Why is no real title available?)
- Competitive routing over time
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- Distributed selfish load balancing on networks
- Distributed Learning of Wardrop Equilibria
- Nonpreemptive coordination mechanisms for identical machines
- Noncooperative load balancing in distributed systems
- Nash social welfare in selfish and online load balancing
- Strong equilibria in games with the lexicographical improvement property
- Fully mixed Nash equilibria for the load balancing games on uniform parallel machines
- Efficiency analysis of load balancing games with and without activation costs
- Distributed selfish load balancing with weights and speeds
- The power of one evil secret agent
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
- Measurement-based efficient resource allocation with demand-side adjustments
- Selfish load balancing and atomic congestion games
- Maximizing the Minimum Load for Selfish Agents
- Machine load balancing game with linear externalities
- The price of anarchy for a berth allocation game
- Distributed Selfish Load Balancing
- Maximizing the minimum load: the cost of selfishness
This page was built for publication: Selfish load balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524729)
