A Simple Graph-Theoretic Model for Selfish Restricted Scheduling

Abstract

In this work, we introduce and study a simple, graph-theoretic model for selfish scheduling among m noncooperative users over a collection of n machines; however, each user is restricted to assign its unsplittable load to one from a pair of machines that are allowed for the user. We model these bounded interactions using an interaction graph, whose vertices… (More)
DOI: 10.1007/11600930_20

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Elssser2005ASG, title={A Simple Graph-Theoretic Model for Selfish Restricted Scheduling}, author={Robert Els{\"a}sser and Martin Gairing and Thomas L{\"{u}cking and Marios Mavronicolas and Burkhard Monien}, booktitle={WINE}, year={2005} }