Abstract
This paper deals with cost allocation problems arising from connection situations where edge costs are closed intervals of real numbers. To solve such problems, we extend classical solutions from the theory of minimum cost spanning tree games. We study the properties of such solutions and suggest how to use them under uncertainty conditions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
