This paper introduces cooperative games arising from multi-depot Chinese postman problems and explores the properties … of these games. A multi-depot Chinese postman problem (MDCP) is represented by a connected (di)graph G, a set of k depots … characterizes globally and locally k-CP balanced and submodular (di)graphs. A (di)graph G is called globally (locally) k-CP balanced …

In this paper we study a class of cooperative sequencing games that arise from one-machine sequencing situations in … which chain precedence relations are imposed on the jobs. It is shown that these sequencing games are convex. …

This paper analyses Chinese postman games with repeated players, which generalize Chinese postman games by dropping the … Chinese postman-totally balanced and Chinese postman-submodular graphs shown in Granot et al. (1999). We illustrate the … totally balancedness of Chinese postman games with repeated players. Therefore, we focus on sufficient conditions on the …

This paper analyses Chinese postman games with repeated players, which generalize Chinese postman games by dropping the … Chinese postman-totally balanced and Chinese postman-submodular graphs shown in Granot et al. (1999). We illustrate the … totally balancedness of Chinese postman games with repeated players. Therefore, we focus on sufficient conditions on the …

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 …. Furthermore, it is shown that m-sequencing games are balanced if m=1,2. Finally, if m>2, balancedness is established for two …

schemes of simple games in which for every path coalition the Shapley value of the associated subgame provides the allocation …