Partitioning Sequencing Situations and Games

M. Gerichhausen, H.J.M. Hamers

Research output: Working paperDiscussion paperOther research output

242 Downloads (Pure)

Abstract

The research that studies the interaction between sequencing situations and cooperative games, that started with the paper of Curiel et al. (1989), has become an established line of research. This paper introduces a new model in this field: partitioning sequencing situations and games. The characteristic of partitioning sequencing situations is that the jobs arrive in batches, and those jobs that arrive in earlier batches have some privileges over jobs in later arrived batches. For partitioning sequencing situations we introduce and characterise the partitioning equal gain splitting rule. Next, we define cooperative games that arise from these partitioning sequencing situations. It is shown that these games are convex. Moreover, we present a game independent expression for the Shapley value. Finally, it is shown that the partitioning equal gain splitting rule can be used to generate a core allocation and can be viewed as the average of two specific marginal vectors.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages16
Volume2007-40
Publication statusPublished - 2007

Publication series

NameCentER Discussion Paper
Volume2007-40

Keywords

  • Sequencing situations
  • sequencing games

Fingerprint Dive into the research topics of 'Partitioning Sequencing Situations and Games'. Together they form a unique fingerprint.

Cite this