Job Scheduling and Bin Packing from a Game Theoretical Perspective: An Evolutionary Approach

Two important network system problems, the job scheduling, and the bin packing problem are presented from a game theoretical perspective. Solution concepts are related to Nash and Aumann equilibria. The concept of Aumann equilibrium is viewed from a different perspective. A generative relation of the Aumann equilibrium is considered. A generative relation is used for the evolutionary detection of the equilibrium. The numerical experiments demonstrate the effectiveness of the proposed method in addressing job scheduling and bin packing problems.