Pages that link to "Item:Q5428841"
From MaRDI portal
The following pages link to Strong Price of Anarchy for Machine Load Balancing (Q5428841):
Displayed 34 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Partition equilibrium always exists in resource selection games (Q372982) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Profit sharing with thresholds and non-monotone player utilities (Q506517) (← links)
- Selfish bin packing (Q534779) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Selfish vector packing (Q1979465) (← links)
- Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Partition Equilibrium Always Exists in Resource Selection Games (Q3162506) (← links)
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
- Selfish Vector Packing (Q3452809) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- Balancing Load via Small Coalitions in Selfish Ring Routing Games (Q5245837) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Approximate Strong Equilibrium in Job Scheduling Games (Q5459972) (← links)
- The Price of Stochastic Anarchy (Q5459995) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
- Scheduling games with rank-based utilities (Q6160122) (← links)