Abstract
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is an ultrametric. We show that every ultrametric minimum cost spanning tree game is reduced to a cost allocation game on a rooted tree. It follows that there exist O(n 2 ) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametric minimum cost spanning tree games, where n is the number of players.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of the Operations Research Society of Japan
Disclaimer: 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.