Game-Theoretical Models of the Grid User Decisions in Security-Assured Scheduling: Basic Principles and Heuristic-Based Solutions

  • Joanna Kołodziej
Part of the Studies in Computational Intelligence book series (SCI, volume 419)


This chapter presents two non-cooperative game approaches, namely the symmetric non-zero sum game and asymmetric Stackelberg game, for modelling the grid users’ behavior. These models allow to illustrate new scenarios in scheduling and resource allocation problems, such as asymmetric users’ relations, security and reliability restrictions in computational grids (CGs). Four GA-based hybrid schedulers are implemented for the approximation of the equilibriumstates of both games. The proposed hybrid resolution methods are empirically evaluated through the grid simulator under the heterogeneity, security, large-scale and dynamics conditions.


Genetic Algorithm Completion Time Grid Resource Stackelberg Game Resource Owner 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of Computer Science Cracow University of TechnologyCracowPoland

Personalised recommendations