Optimal Coordination Mechanisms for Multi-job Scheduling Games

@inproceedings{Abed2014OptimalCM,
  title={Optimal Coordination Mechanisms for Multi-job Scheduling Games},
  author={Fidaa Abed and Jos{\'e} R. Correa and Chien-Chung Huang},
  booktitle={ESA},
  year={2014}
}
We consider the unrelated machine scheduling game in which players control subsets of jobs. Each player’s objective is to minimize the weighted sum of completion time of her jobs, while the social cost is the sum of players’ costs. The goal is to design simple processing policies in the machines with small coordination ratio, i.e., the implied equilibria are within a small factor of the optimal schedule. We work with a weaker equilibrium concept that includes that of Nash. We first prove that… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Non-clairvoyant Scheduling Games

Theory of Computing Systems • 2011
View 4 Excerpts
Highly Influenced

Various optimizers for single stage production

W. Smith
Naval Res. Logist. Quart., • 1956
View 6 Excerpts
Highly Influenced

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

J. R. Correa, M. Queyranne
Naval Res. Logist., • 2012
View 2 Excerpts

Similar Papers

Loading similar papers…