Abstract

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
machine covering 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 $min(m,(2+eps)s_1/s_m)$ where $eps>0$ can
be chosen arbitrarily small and $s_i$ is the (real) speed of
machine $i$. Finally we give improved results for two machines.

@InProceedings{epstein_et_al:DagSemProc.07261.10,
  author =	{Epstein, Leah and van Stee, Rob},
  title =	{{Maximizing the Minimum Load for Selfisch Agents}},
  booktitle =	{Fair Division},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7261},
  editor =	{Steven Brams and Kirk Pruhs and Gerhard Woeginger},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1242},
  URN =		{urn:nbn:de:0030-drops-12427},
  doi =		{10.4230/DagSemProc.07261.10},
  annote =	{Keywords: Scheduling, algorithmic mechanism design, maximizing minimum load}
}