On the vertices of the k-additive core

The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinatorics, where it is related to submodular functions, matroids and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games are those games whose M

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Michel Grabisch, Pedro Miranda
• Keywords: Additive Games, DM 2008, Greedy Algorithm, K-additive Games