Abstract
This paper studies the nucleolus of graph-restricted games as an alternative for the Shapley value to evaluate communication situations. We focus on the inheritance of properties of cooperative games related to the nucleolus: strong compromise admissibility and compromise stability. These two properties allow for a direct, closed formula for the nucleolus. We characterize the families of graphs for which the graph-restricted games inherit these properties from the underlying games. Moreover, for each of these two properties, we characterize the family of graphs for which the nucleolus is invariant
Sign-in/Register to access full text options 
Talk to us
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.
