THE LEAST CORE, KERNEL AND BARGAINING SETS OF LARGE GAMES

We study the least core, the kernel and bargaining sets of coalitional games with a countable set of players. We show that the least core of a continuous superadditive game with a countable set of players is a nonempty (norm-compact) subset of the space of all countably additive measures. Then we show that in such games the intersection of the prek ernel and the least core is non-empty. Finally, we show that the Auman n-Maschler and the Mas-Colell bargaining sets contain the set of all c ountably additive payoff measures in the prekernel.