Permutation games: another class of totally balanced games

Tijs, S. H. ; Parthasarathy, T. ; Potters, J. A. M. ; Rajendra Prasad, V. (1984) Permutation games: another class of totally balanced games OR-Spektrum, 6 (2). pp. 119-123. ISSN 0171-6468

Full text not available from this repository.

Official URL: http://www.springerlink.com/index/U24234V0T0K7R505...

Related URL: http://dx.doi.org/10.1007/BF01721088

Abstract

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.

Item Type:Article
Source:Copyright of this article belongs to Springer.
ID Code:90930
Deposited On:15 May 2012 09:55
Last Modified:15 May 2012 09:55

Repository Staff Only: item control page