Game-Theoretical Models of the Grid User Decisions in Security-Assured Scheduling: Basic Principles and Heuristic-Based Solutions
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.
KeywordsGenetic Algorithm Completion Time Grid Resource Stackelberg Game Resource Owner
Unable to display preview. Download preview PDF.