Optimization Implementation and Characterization of the Equal Allocation of Nonseparable Costs Value

This paper devotes to the study of the equal allocation of nonseparable costs value for cooperative games. On the one hand, we show that the equal allocation of nonseparable costs value is the unique optimal solution that minimizes the total complaints for individual players over the pre-imputation set. On the other hand, analogously to the way of determining the Nucleolus, we obtain the equal allocation of nonseparable costs value by applying the lexicographic order over the individual complaints. Moreover, we offer alternative characterizations of the equal allocation of nonseparable costs value by proposing several new properties such as dual nullifying player property, dual dummifying player property and grand marginal contribution monotonicity.