This article introduces the upper optimal complaint value for TU-games. The value is characterized by lexicographically minimizing a maximal complaint vector. Interestingly, this value coincides with EANSC value and (pre)-nucleolus… Click to show full abstract
This article introduces the upper optimal complaint value for TU-games. The value is characterized by lexicographically minimizing a maximal complaint vector. Interestingly, this value coincides with EANSC value and (pre)-nucleolus for some classes of TU-games.
               
Click one of the above tabs to view related content.