A generalization of processing problems with restricted capacities is introduced.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.The new aspect is that players have interest in all jobs. The corresponding cooperative game of this generalization is proved to be totally balanced.
|Place of Publication||Tilburg|
|Number of pages||11|
|Publication status||Published - 2004|
|Name||CentER Discussion Paper|
- Processing games
- core allocation