Strong Price of Anarchy for Machine Load Balancing
From MaRDI portal
Recommendations
Cited in
(40)- The price of anarchy on uniformly related machines revisited
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- Inefficiency of equilibria for the machine covering game on uniform machines
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- The Price of Anarchy for Minsum Related Machine Scheduling
- Selfish load balancing for jobs with favorite machines
- Selfish bin packing
- The price of anarchy for machine load balancing games
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- On the inefficiency of equilibria in linear bottleneck congestion games
- Strong price of anarchy
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- Strong stability of Nash equilibria in load balancing games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Load rebalancing games in dynamic systems with migration costs
- Strong equilibrium in cost sharing connection games
- The Price of Anarchy on Uniformly Related Machines Revisited
- The strong price of anarchy of linear bottleneck congestion games
- Scheduling games with rank-based utilities
- Strong price of anarchy
- The Price of Stochastic Anarchy
- Selfish Bin Packing
- Scheduling selfish jobs on multidimensional parallel machines
- Approximate Strong Equilibrium in Job Scheduling Games
- Equilibria in load balancing games
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- On the complexity of Pareto-optimal Nash and strong equilibria
- Partition equilibrium always exists in resource selection games
- Partition Equilibrium Always Exists in Resource Selection Games
- Strong equilibria in games with the lexicographical improvement property
- Profit sharing with thresholds and non-monotone player utilities
- Sequential solutions in machine scheduling games
- Non-clairvoyant scheduling games
- Selfish vector packing
- Selfish vector packing
- Collusion in atomic splittable routing games
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
This page was built for publication: Strong Price of Anarchy for Machine Load Balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428841)
