One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1016/j.econlet.2019.108864
Copy DOI
Export
Save
Share
Cite Journal: Economics Letters |  Publication Date: Nov 21, 2019 |
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.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
