Vol. 50, No. 2, 1974

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 294: 1
Vol. 293: 1  2
Vol. 292: 1  2
Vol. 291: 1  2
Vol. 290: 1  2
Vol. 289: 1  2
Vol. 288: 1  2
Vol. 287: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Special Issues
Submission Guidelines
Submission Form
Contacts
Author Index
To Appear
 
ISSN: 0030-8730
Kernels of compound games with simple components

Nimrod Megiddo

Vol. 50 (1974), No. 2, 531–555
Abstract

The kernel is a solution concept for a cooperative game. It reflects symmetry properties of the characteristic function and desirability relations over the set of the players. Given m games over disjoint sets of players and an m-person game, one defines a compound game over the union of the m disjoint sets. These m games are the components and the above m-person game is called the quotient. The quotient may be treated as a game played by representatives of the component games.

The kernel of the compound game is characterized fully. The compound kernel is, in fact, a composition of the components’ kernels by means of a distinguished subset of the imputation space of the quotient game. This subset depends also on the number of veto players in each component.

An effective formula for the compound kernel is given for compound simple games. This formula enables short cuts in the computations leading to the kernel of a decomposable game. The results are applied to compound majority games and a complete description of their kernels is given.

Mathematical Subject Classification
Primary: 90D12
Milestones
Received: 28 September 1972
Revised: 20 March 1973
Published: 1 February 1974
Authors
Nimrod Megiddo