TY - GEN
T1 - Maximizing the minimum load for selfish agents
AU - Epstein, Leah
AU - Van Stee, Rob
PY - 2008
Y1 - 2008
N2 - We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the classical load balancing problem, this problem has not been considered for selfish agents until now. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs. It uses a new technique for reducing the number of jobs while remaining close to the optimal solution. We also present an FPTAS for the classical problem, i.e., where no selfish agents are involved (the previous best result for this case was a PTAS) and use this to give a monotone FPTAS. Additionally, we give a monotone approximation algorithm with approximation ratio where can be chosen arbitrarily small and s i is the (real) speed of machine i. Finally we give improved results for two machines.
AB - We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the classical load balancing problem, this problem has not been considered for selfish agents until now. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs. It uses a new technique for reducing the number of jobs while remaining close to the optimal solution. We also present an FPTAS for the classical problem, i.e., where no selfish agents are involved (the previous best result for this case was a PTAS) and use this to give a monotone FPTAS. Additionally, we give a monotone approximation algorithm with approximation ratio where can be chosen arbitrarily small and s i is the (real) speed of machine i. Finally we give improved results for two machines.
UR - http://www.scopus.com/inward/record.url?scp=43049141881&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78773-0_23
DO - 10.1007/978-3-540-78773-0_23
M3 - Conference contribution
AN - SCOPUS:43049141881
SN - 3540787720
SN - 9783540787723
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 264
EP - 275
BT - LATIN 2008
T2 - 8th Latin American TheoreticalINformatics Symposium, LATIN 2008
Y2 - 7 April 2008 through 11 April 2008
ER -