In cooperative games, the core is the most popular solution concept, and its properties are well known. In the classical setting of cooperative games, it is generally assumed that all coalitions can form, i.e., they are all feasible. In many situations, this assumption is too strong and one has...

In cooperative game theory, games in partition function form are real-valued function on the set of so-called embedded coalitions, that is, pairs $(S,\pi)$ where $S$ is a subset (coalition) of the set $N$ of players, and $\pi$ is a partition of $N$ containing $S$. Despite the fact that many...

In the classical setting of cooperative game theory, it is always assumed that all coalitions are feasible. However in many real situations, there are restrictions on the set of coalitions, for example duo to communication, order or hierarchy on the set of players, etc. There are already many...

This paper investigates the statistical properties of the Choquet and Sugeno integrals, used as multiattribute models. The investigation is done on an empirical basis, and focuses on two topics: the distribution of the output of these integrals when the input is corrupted with noise, 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 the game. Based on the concept of $k$-additivity, we define the so-called $k$-balanced games and the...

We study and compare two frameworks: a model of influence, and command games. In the influence model, in which players are to make a certain acceptance/rejection decision, due to influence of other players, the decision of a player may be different from his inclination. We study a relation...

We address in this paper the problem of scoring alternatives when they are evaluated with respect to several criteria on a finite ordinal scale $E$. We show that in general, the ordinal scale $E$ has to be refined or shrunk in order to be able to represent the preference of the decision maker by...

Bi-cooperative games were introduced by Bilbao et al. as a generalization of TU cooperative games, in which each player can participate positively, negatively, or not at all. In this paper, we propose a definition of a share of the worth obtained by some players after they decided on their...

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