Pages that link to "Item:Q1041221"
From MaRDI portal
The following pages link to Maximizing the minimum load for selfish agents (Q1041221):
Displaying 8 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- The resource dependent assignment problem with a convex agent cost function (Q1753596) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
