In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed.We show that these games are balanced by obtaining two core elements that depend only on the optimal schedule for the grand coalition.Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.
|Place of Publication||Tilburg|
|Number of pages||23|
|Publication status||Published - 2003|
|Name||CentER Discussion Paper|