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 ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.
|Place of Publication||Tilburg|
|Number of pages||15|
|Publication status||Published - 1998|
|Name||CentER Discussion Paper|
- cooperative games
- sequencing situations