Abstract
AbstractThis article introduces fixed tree games with multilocated players (FMP games), which are a generalization of standard fixed tree games. This generalization consists of allowing players to be located in more than one vertex. As a consequence, these players can choose among several ways of connection to the root. In this article we show that FMP games are balanced. Moreover, we prove that the core of an FMP game coincides with the core of a related submodular standard fixed tree game. We show how to find the nucleolus and we characterize the orders that provide marginal vectors in the core of an FMP game. Finally, we study the Shapley value and the average of the extreme points of the core. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 93–101 2006
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.
