A class of solutions are introduced by lexicographically minimizing the complaint of coalitions for cooperative games with transferable utility. Among them, the nucleolus is an important representative. From the perspective of measuring the satisfaction of coalitions with respect to a payoff vector, we define a family of optimal satisfaction values in this paper. The proportional division value and the proportional allocation of non-separable contribution value are then obtained by lexicographically maximizing two types of satisfaction criteria, respectively, which are defined by the lower bound and the upper bound of the core from the viewpoint of optimism and pessimism respectively. Correspondingly, we characterize these two proportional values by introducing the equal minimal satisfaction property and the associated consistency property. Furthermore, we analyze the duality of these axioms and propose more approaches to characterize these two values on basis of the dual axioms.
Full Text Finder