Processing Games with Shared Interest

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

Research output: Working paperDiscussion paperOther research output

259 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

Fingerprint

Game
Cooperative Game
Completion Time
Finite Set
Linearly
Costs
Generalization

Keywords

  • Processing games
  • scheduling
  • core allocation

Cite this

Quant, M., Meertens, M., & Reijnierse, J. H. (2004). Processing Games with Shared Interest. (CentER Discussion Paper; Vol. 2004-126). Tilburg: Operations research.
Quant, M. ; Meertens, M. ; Reijnierse, J.H. / Processing Games with Shared Interest. Tilburg : Operations research, 2004. (CentER Discussion Paper).
@techreport{016ac415c70e453facfba2a4724d6002,
title = "Processing Games with Shared Interest",
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.",
keywords = "Processing games, scheduling, core allocation",
author = "M. Quant and M. Meertens and J.H. Reijnierse",
note = "Subsequently published in Annals of Operations Research, 2008 Pagination: 11",
year = "2004",
language = "English",
volume = "2004-126",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Quant, M, Meertens, M & Reijnierse, JH 2004 'Processing Games with Shared Interest' CentER Discussion Paper, vol. 2004-126, Operations research, Tilburg.

Processing Games with Shared Interest. / Quant, M.; Meertens, M.; Reijnierse, J.H.

Tilburg : Operations research, 2004. (CentER Discussion Paper; Vol. 2004-126).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Processing Games with Shared Interest

AU - Quant, M.

AU - Meertens, M.

AU - Reijnierse, J.H.

N1 - Subsequently published in Annals of Operations Research, 2008 Pagination: 11

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Processing games

KW - scheduling

KW - core allocation

M3 - Discussion paper

VL - 2004-126

T3 - CentER Discussion Paper

BT - Processing Games with Shared Interest

PB - Operations research

CY - Tilburg

ER -

Quant M, Meertens M, Reijnierse JH. Processing Games with Shared Interest. Tilburg: Operations research. 2004. (CentER Discussion Paper).