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

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

with payments. Second we show that the nucleolus of an n-player matching game with a nonempty core can be computed in O(n4 … we present an O(nm+n2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n … vertices and m edges is nonempty and that computes a core member if the core is nonempty. This algorithm improves previous work …

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

coalitions determine both the core and the nucleolus in monotonic games whenever the core is non-empty. We show how these two …We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility … sample computation of the nucleolus of bankruptcy games - the shortest of its kind. …

coalitions determine both the core and the nucleolus in monotonic games whenever the core is non-empty. We show how these two …We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility … sample computation of the nucleolus of bankruptcy games - the shortest of its kind. …

games. Liability games are superadditive, constant sum, partially convex, and partially concave. The core of a liability … game is empty if and only if the firm is insolvent and has multiple positive liabilities. We analyze the nucleolus of the … game and show that allocating the asset value of the firm using the nucleolus satisfies efficiency, non-negativity, and …

We study linearly weighted versions of the least core and the (pre)nucleolus and investigatethe reduction possibilities … core and the per-capita (pre)nucleolus from the dual game. This could lead to the design of polynomial time algorithms for … the per-capita (and other monotone nondecreasingly weighted versions of the) least core and the (pre)nucleolus in specific …

with payments. Second we show that the nucleolus of an n-player matching game with a nonempty core can be computed in O(n4 …. First we present an O(nm+n2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n … vertices and m edges is nonempty and that computes a core member if the core is nonempty. This algorithm improves previous work …