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