Abstract
The Owen graph value is a generalization of the well-known Owen value to cooperative games with graph-restricted communication. The value satisfies the property of component efficiency, but loses the property of efficiency. The efficiency requirement imposes that the total wealth generated in a cooperative game is divided among its players. In this paper we introduce an efficient extension of the Owen graph value and provide three characterizations for the efficient Owen graph value. Finally, we compare the value with other efficient values by an application example.
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.
