A Method for Computing the Kernel of n-Person Games
From MaRDI portal
Publication:5343983
DOI10.2307/2003937zbMath0133.43104MaRDI QIDQ5343983
P. Rabinowitz, Robert John Aumann, Bezalel Peleg
Publication date: 1965
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2003937
91A06: (n)-person games, (n>2)
Related Items
Directed and weighted majority games, Coalition formation in simple games with dominant players, Bargaining set theory and stability in coalition governments, The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs, The reactive bargaining set of some flow games and of superadditive simple games, The kernel for the grand coalition of the four-person game, The kernel of the composition of characteristic function games, The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\)., The competitive bargaining set for cooperative \(n\)-person games, An LP approach to compute the pre-kernel for cooperative games