A Method for Computing the Kernel of n-Person Games

DOI10.2307/2003937MaRDI QIDQ5343983zbMATH OpenOpenAlexFDO

Authors Robert J. Aumann, Bezalel Peleg, P. Rabinowitz

Publication date 1965

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2003937

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06)

Cited in

(13)

• 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
• A note on the inclusion of the kernel in the core of the bilateral assignment game
• A computational method for solving \(n\)-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
• scientific article; zbMATH DE number 592685 (Why is no real title available?)
• Directed and weighted majority games

This page was built for publication: A Method for Computing the Kernel of n-Person Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343983)