Summary
A class of cooperative games in characteristic function form arising from certain sequencing problems and assignment problems, is introduced. It is shown that games of this class are totally balanced. In the proof of this fact we use the Birkhoff-von Neumann theorem on doubly stochastic matrices and the Bondareva-Shapley theorem on balanced games. It turns out that this class of permutation games coincides with the class of totally balanced games if the number of players is smaller than four. For larger games the class of permutation games is a nonconvex subset of the convex cone of totally balanced games.
Zusammenfassung
Wir führen eine Klasse von kooperativen Spielen in charakteristischer Funktionsform ein, die bei gewissen Folgeproblemen und Zuordnungsproblemen auftreten. Wir zeigen, daß diese Spiele vollständig balanciert sind. Zum Beweis verwenden wir den Satz von Birkhoff-von Neumann über doppelt stochastische Matrizen und den Satz von Bondareva-Shaplex über balancierte Spiele. Es zeigt sich, daß diese Klasse von Permutationsspielen mit der Klasse von vollständig balancierten Spiele übereinstimmt, falls die Zahl der Spieler kleiner als vier ist. Für größere Spiele ist die Klasse der Permutationsspiele eine nichtkonvexe Teilmenge des konvexen Kegels der vollständig balancierten Spiele.
Similar content being viewed by others
References
Billera LJ (1981) Economic market games. Game theory and its applications. Proceedings of Symposia in Applied Mathematics 24:37–53
Birkhoff G (1948) Lattice theory. Revised edition Am Math Soc Coll Series 25:266
Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games (in Russian). Probl Kibern 10:119–139
Dubey P, Shapley L (1982) Totally balanced games arising from controlled programming problems. Discussion paper
Granot D, Huberman G (1981) Minimum cost spanning tree games. Math Programming 21:1–18
Kalai E, Zemel E (1982) Totally balanced games and games of flow. Math Oper Res 7:476–478
Kalai E, Zemel E (1982) Generalized network problems yielding totally balanced games. Oper Res 30:998–1008
Neumann J von (1953) A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games II:5–12
Owen G (1975) On the core of linear production games. Math Programming 9:358–370
Shapley LS (1967) On balanced sets and cores. Nav Res Logistics Q 14:453–460
Shapley LS (1983) Private Communication
Shapley L, Scarf H (1974) On cores and indivisibility. J Math Econom 1:23–37
Shapley LS, Shubik M (1969) On market games. J Econom Theory 1:9–25
Shapley LS, Shubik M (1972) The assignment game I: The core. Int J Game Theory 1:111–130
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tijs, S.H., Parthasarathy, T., Potters, J.A.M. et al. Permutation games: Another class of totally balanced games. OR Spektrum 6, 119–123 (1984). https://doi.org/10.1007/BF01721088
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01721088