Competing Schedulers

Itai Ashlagi, Moshe Tennenholtz, Aviv Zohar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Previous work on machine scheduling has considered the case of agents who control the scheduled jobs and attempt to minimize their own completion time. We argue that in cloud and grid computing settings, different machines cannot be considered to be fully cooperative as they may belong to competing economic entities, and that agents can easily move their jobs between competing providers. We therefore consider a setting in which the machines are also controlled by selfish agents, and attempt to maximize their own gains by strategically selecting their scheduling policy. We analyze the equilibria that arise due to competition in this 2-sided setting. In particular, not only do we require that the jobs will be in equilibrium with one another, but also that the schedulers' policies will be in equilibrium. We also consider different mixtures of classic deterministic scheduling policies and random scheduling policies.

Original languageAmerican English
Title of host publicationProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
PublisherAAAI Press
Number of pages6
ISBN (Electronic)9781577354642
StatePublished - 15 Jul 2010
Event24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States
Duration: 11 Jul 201015 Jul 2010

Publication series

NameProceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010


Conference24th AAAI Conference on Artificial Intelligence, AAAI 2010
Country/TerritoryUnited States

Bibliographical note

Publisher Copyright:
© 2010, Association for the Advancement of Artificial Intelligence ( All rights reserved.


Dive into the research topics of 'Competing Schedulers'. Together they form a unique fingerprint.

Cite this