We provide simple constructive proofs of balancedness of classes of m-PS games, which arise from sequencing situations with m parallel machines. This includes the setting that is studied by Calleja et al. (2001) and Calleja et al. (2002), who provided a complex constructive proof and a simple non-constructive proof of balancedness of a restricted class of 2-PS games, respectively. Furthermore, we provide two counterexamples to illustrate that our balancedness results cannot be extended to a general setting.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Number of pages||13|
|Publication status||Published - 2003|
|Name||BETA publicatie : working papers|