On the Balancedness of M-Sequencing Games

H.J.M. Hamers; F. Klijn; J.P.M. Suijs

On the Balancedness of M-Sequencing Games

H.J.M. Hamers, F. Klijn, J.P.M. Suijs

Research output: Working paper › Discussion paper › Other research output

243 Downloads (Pure)

Abstract

This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.

Original language	English
Place of Publication	Tilburg
Publisher	Operations research
Number of pages	15
Volume	1998-17
Publication status	Published - 1998

Publication series

Name	CentER Discussion Paper
Volume	1998-17

Keywords

cooperative games
sequencing situations

Access to Document

17

Cite this

@techreport{c3573ae58914487ea2f15e276a186c45,

title = "On the Balancedness of M-Sequencing Games",

abstract = "This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.",

keywords = "cooperative games, sequencing situations",

author = "H.J.M. Hamers and F. Klijn and J.P.M. Suijs",

note = "Pagination: 15",

year = "1998",

language = "English",

volume = "1998-17",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}

TY - UNPB

T1 - On the Balancedness of M-Sequencing Games

AU - Hamers, H.J.M.

AU - Klijn, F.

AU - Suijs, J.P.M.

N1 - Pagination: 15

PY - 1998

Y1 - 1998

N2 - This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.

AB - This paper studies m-sequencing games that arise from sequencing situations with m parallel and identical machines. These m-sequencing games, which involve n players, give rise to m-machine games, which involve m players. Here, n corresponds to the number of jobs in an m-sequencing situation, and m corresponds to the number of machines in the same m-sequencing situation. We prove that an m-sequening game is balanced if and only if the corresponding m-machine game is balanced. Furthermore, it is shown that m-sequencing games are balanced ifm 2 f1;2g. Finally, ifm 3, balancedness is established for two special classes of m-sequencing games.

KW - cooperative games

KW - sequencing situations

M3 - Discussion paper

VL - 1998-17

T3 - CentER Discussion Paper

BT - On the Balancedness of M-Sequencing Games

PB - Operations research

CY - Tilburg

ER -