A polymatroid associated with convex games (Q1079574)

Let G(N,\(\nu)\) be an n-person cooperative game with side-payments where \(N=\{1,2,...,n\}\) is the set of players, \(\nu\) the characteristic function of G. The authors consider convex games with \(\nu (\{i\})=0\), for all \(i\in N\) and \(\nu (\phi)=0\) and they define a polymatroid by using the characteristic function of the game. An equivalence between the properties of a partition of the players and those of the principal partition of the polymatroid is obtained. Particularly, they obtain a relation between the critical value of the polymatroid and the minimum amount of reasonable requirement for coalitions at the time of their amalgamation.