loading...
An Antisocial Strategy for Scheduling Mechanisms
Denver, Colorado April 04-April 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2005.8619th IEEE International Parallel and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nandan Garg, Wayne State University, Detroit, MI
Daniel Grosu, Wayne State University, Detroit, MI
Vipin Chaudhary, Wayne State University, Detroit, MI
Previous work on task scheduling mechanisms assumed that the agent's goal is to maximize its own profit without considering the effect of its strategy on the other agents' profit. This is not always the case, an agent may want to cause loses to the other agents besides maximizing its profit. Such an agent is said to be an antisocial agent. An antisocial agent will try to gain as much profit as possible relative to the other agents. In this paper we consider a mechanism for task scheduling on related machines in which each machine is associated with an agent. We develop an antisocial strategy which can be used by an antisocial agent to inflict losses to the other participating agents. We analyze the effect of different degrees of agent's antisociality on the losses inflicted to the other agents.
Citation:
Nandan Garg, Daniel Grosu, Vipin Chaudhary, "An Antisocial Strategy for Scheduling Mechanisms," ipdps, vol. 9, pp.203a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8, 2005
Usage of this product signifies your acceptance of the Terms of Use.