zbMATH — the first resource for mathematics

Sequencing games. (English) Zbl 0674.90107
Sequencing situations with linear cost functions are considered. Cooperative game theory is applied to analyze these situations. The convexity of these games is verified, and the Shapley values are determined.
Reviewer: F.Szidarovszky

91A12 Cooperative games
90B22 Queues and service in operations research
Full Text: DOI
[1] Baker, K.R., Introduction to sequencing and scheduling, (1974), Wiley New York
[2] Driessen, T.S.H.; Tijs, S.H., The τ-value, the core and semiconvex games, International journal of game theory, 14, 229-247, (1985) · Zbl 0582.90108
[3] Gillies, D.B., Some theorems on n-person games, () · Zbl 0050.14406
[4] Shapley, L.S., A value for n-person games, Annals of mathematics study, 28, 307-317, (1953) · Zbl 0050.14404
[5] Shapley, L.S., Cores of convex games, International journal of game theory, 1, 11-26, (1971) · Zbl 0222.90054
[6] Tijs, S.H., Bounds for the core and the τ-value, (), 123-132
[7] Tijs, S.H.; Parthasarathy, T.; Potters, J.A.M.; Rajendra Prasad, V., Permutation games: another class of totally balanced games, OR spektrum, 6, 119-123, (1984) · Zbl 0537.90101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.