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

-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 …

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These … lexicographic rules is shown to satisfy many desirable properties (core selection, symmetry, demand additivity,...). Our method …

blocking pairs. We give a polynomial-time algorithm that either finds that no stable solution exists, or obtains a stable … stable solutions of a multiple partners matching game in two different ways and perform a study on the core of the … the existence of a stable solution and the non-emptiness of the core, which holds in the other models with payments, is no …

-firm-buyer games have non-empty core. We show that for these games the core coincides with the classical bargaining set (Davis and …