| A multiperson cooperative game G(N,;A basic coalition contains exactly one player of each type and has a nonnegative value. A feasible allocation of a game's value ;For each game, the basic coalition values are represented by a k-dimensional array. Imputation sets are described, and the core is defined in terms of coalition values and individual payoffs. Necessary and sufficient conditions for the core to be nonempty are presented in terms of balanced sets of the players. The theorems proven here greatly reduce the number of these conditions required by employing the Bondareva-Shapley Theorem. A simple iterative method for generating the balanced sets for G(2;Using Monte Carlo methods on randomly generated coalition values, the probabilities of nonempty cores in G(2... |
