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 …

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

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

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

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 …

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

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