Processing Games with Shared Interest

M. Quant, M. Meertens, J.H. Reijnierse

Research output: Working paper/PreprintDiscussion paperOther research output

280 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages11
Volume2004-126
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-126

Keywords

  • Processing games
  • scheduling
  • core allocation

Fingerprint

Dive into the research topics of 'Processing Games with Shared Interest'. Together they form a unique fingerprint.

Cite this