Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have