Abstract
In (1), M. Davis and M. Maschler define the kernel K of a characteristic-function game; they also prove, among other theorems, that K is a subset of the bargaining set M1(i) and that it is never void, i.e. that for each coalition structure b there exists a payoff vector x such that the payoff configuration (x, b) belongs to K. The main advantage of the kernel, as it seems to us, is that it is easier to compute in many cases than the bargaining set M1(i).

This publication has 1 reference indexed in Scilit: