Individual weighted excess and least square values
Tóm tắt
This work deals with the weighted excesses of players in cooperative games which are obtained by summing up all the weighted excesses of all coalitions to which they belong. We first show that the resulting payoff vector is the corresponding least square value by lexicographically minimizing the individual weighted excesses of players over the preimputation set, and thus give an alternative characterization of the least square values. Second, we show that these results give rise to lower and upper bounds for the core payoff vectors and, using these bounds, we show that the least square values can be seen as the center of a polyhedron defined by these bounds. This provides a second new characterization of the least square values. Third, we show that the individually rational least square value is the solution that lexicographically minimizes the individual weighted excesses of players over the imputation set.