Solution concepts of \(k\)-convex \(n\)-person games (Q1096552)

This paper considers a \(k\)-convex game, which is a generalization of a convex game due to Shapley. The definition is not so straight forward as that of a convex game. The paper investigates the geometrical properties of several solution concepts, the core, bargaining set, kernel, prekernel, nucleolus. Shapley value and \(\tau\)-value, for \(k\)-convex games. The paper gives many propositions, e.g., for \(k\)-convex games, the intersection of the (pre)kernel with the core consists of a unique point (the nucleolus). However, the reviewer could not find the main point of the paper.