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

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

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

is a further generalization of the model introduced by Eriksson and Karlander [2]. We prove that the core of our model is … always non-empty by providing an algorithm that determines a stable solution in O(n4). …