The least core, kernel and bargaining sets of large games
Dov Monderer,
Ezra Einy and
Diego Moreno ()
Additional contact information Dov Monderer: Faculty of Industrial Engineering and Management, Technion-Israel Institute of Technology, Haifa, ISRAEL
Ezra Einy: Departamento de Economía, Universidad Carlos III de Madrid, E-28903 Getafe, Madrid, SPAIN
Abstract:
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 non-empty (norm-compact) subset of the space of all countably additive measures. Then we show that in such games the intersection of the prekernel and the least core is non-empty. Finally, we show that the Aumann-Maschler and the Mas-Colell bargaining sets contain the set of all countably additive payoff measures in the prekernel.