The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

摘要

We consider minimum cost spanning tree problems with multiple sources. We propose a cost allocation rule based on a painting procedure. Agents paint the edges on the paths connecting them to the sources. We prove that the painting rule coincides with the folk rule. (C) 2019 Elsevier B.V. All rights reserved.