In this paper, we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of k-additivity, we define the so-called k-balanced games and the...

In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a $k$-additive capacity, i.e. whose Möbius transform vanishes for subsets of more than $k$ elements. Thus, $k$-additive capacities range from probability measures...

In this paper we deal with the set of $k$-additive belieffunctions dominating a given capacity. We follow the lineintroduced by Chateauneuf and Jaffray for dominating probabilities and continued by Grabisch for general $k$-additive measures.First, we show that the conditions for the general...

In this paper we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of $k$-additivity, we define the so-called $k$-balanced games and the...

In this paper, we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of game. Based on the concept of k-additivity, we define to so-called k-balanced games and the...

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