rationing we give a proof to Aumann and Maschlers theorem i.e. the consistent solution of a bankruptcy problem is the nucleolus … proof is not just simple and demonstrative but also provides an insight how the nucleolus is constructed in such games. …

This paper analyzes the 1-nucleolus and, in particular, its relation to the nucleolus and compromise value. It is seen … that the 1-nucleolus of a cooperative game can be characterized using a combination of standard bankruptcy rules for … associated bankruptcy problems. In particular, for any zero-normalized balanced game, the 1-nucleolus coincides with the Aumann …

distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

distribution to every TU-game. A well-known solution is the nucleolus. A cooperative game with a permission structure describes a … computing the nucleolus of every restricted game corresponding to some disjunctive non-negative additive game with an acyclic …

that although the game is not convex its core is always non-empty. Furthermore we provide a painting algorithm for large … families of directed acyclic graph games that finds the nucleolus in polynomial time. …