Maximizing the Minimum Load for Selfish Agents
From MaRDI portal
Publication:5458534
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1182760 (Why is no real title available?)
- scientific article; zbMATH DE number 2079341 (Why is no real title available?)
- scientific article; zbMATH DE number 2119764 (Why is no real title available?)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Algorithms – ESA 2005
- Bounds for Certain Multiprocessing Anomalies
- Frugality in path auctions
- On-line machine covering
- STACS 2004
- STACS 2005
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- The Santa Claus problem
- The exact LPT-bound for maximizing the minimum completion time
- Truthful approximation mechanisms for restricted combinatorial auctions
Cited in
(7)- Tight Bounds for Selfish and Greedy Load Balancing
- Maximizing the minimum load for selfish agents
- Tight bounds for selfish and greedy load balancing
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- scientific article; zbMATH DE number 6381644 (Why is no real title available?)
- Selfish load balancing
- Maximizing the minimum load: the cost of selfishness
This page was built for publication: Maximizing the Minimum Load for Selfish Agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458534)