nucleolus. This paper is an update on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set. …

-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is … a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter … game is also an example (of minimum size) for a game with a non-convex kernel. …

-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is … a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter … game is also an example (of minimum size) for a game with a non-convex kernel. …

nucleolus. This paper is an update on the nucleolus and its two related supersolutions, i.e., the kernel and the bargaining set. …

In this article, we provide a new basis for the kernel of the Shapley value (Shapley, 1953), which is used to construct …

kernel (Davis and Maschler, 1965). We also give an answer to an open question formulated by Rochford (1983) by introducing a … kernel-based set that, together with the core, characterizes the set of SMB. …

{Bawerk horse markets. We prove that for uniform-price assignment games the kernel, or set of symmetrically-pairwise bargained …