A Note on the Computation of the Pre-Kernel for Permutation Games

To determine correctly a non-convex pre-kernel for TU games with more than 4 players can be a challenge full of possible pitfalls, even to the experienced researcher. Parts of the pre-kernel can be easily overlooked. In this note we discuss a method to present the full shape of the pre-kernel for a permutation game as discussed by Solymosi (2014). By using the property in which the pre-kernel is located in the least core for permutation games, the least core can be covered by a small collection of payoff equivalence classes as identified by Meinhardt (2013d) to finally establish the correct shape of the pre-kernel.