On the Balancedness of M-Sequencing Games

Abstract

This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced if m=1,2. Finally, if m>2, balancedness is established for two special classes of m-sequencing games.

JEL Classification: C71