Preserving coalitional rationality for non-balanced games.

In cooperative games, the core is one of the most popular solution concept since it ensures coalitional rationality. For non-balanced games however, the core is empty, and other solution concepts have to be found. We propose the use of general solutions, that is, to distribute the total worth of the game among groups rather than among individuals. In particular, the $$k$$ -additive core proposed by Grabisch and Miranda is a general solution preserving coalitional rationality which distributes among coalitions of size at most $$k$$ , and is never empty for $$k\ge 2$$ . The extended core of Bejan and Gomez can also be viewed as a general solution, since it implies to give an amount to the grand coalition. The $$k$$ -additive core being an unbounded set and therefore difficult to use in practice, we propose a subset of it called the minimal negotiation set. The idea is to select elements of the $$k$$ -additive core mimimizing the total amount given to coalitions of size greater than 1. Thus the minimum negotiation set naturally reduces to the core for balanced games. We study this set, giving properties and axiomatizations, as well as its relation to the extended core of Bejan and Gomez. We give a method of computing the minimum bargaining set, and lastly indicate how to eventually get classical solutions from general ones. [ABSTRACT FROM AUTHOR]