Abstract
A cooperative game with transferable utility is a situation in which players can generate worth by cooperating and obtain a certain payoff via a sharing rule. In this paper we assume that the cooperation between players is restricted by an acyclic graph. We introduce new sharing rule for this type of game. We also offer an axiomatization of this sharing rule, based mainly on linearity and a consistency axiom. For unanimity games, this sharing rule identifies the center of the graph.
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.
