-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

three agent games in characteristic function form to anonymous pillage games, we find: when the core is non-empty, it must … take one of five forms; all such games with an empty core represent the same dominance relation. When a stable set exists …, and may contain continua. Finally, we provide an algorithm for computing the stable set, and can easily decide non …

provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …