Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286530 
Year of Publication: 
2021
Citation: 
[Journal:] SERIEs - Journal of the Spanish Economic Association [ISSN:] 1869-4195 [Volume:] 12 [Issue:] 1 [Year:] 2021 [Pages:] 73-100
Publisher: 
Springer, Heidelberg
Abstract: 
Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused, mainly, in studying how to allocate the connection cost among the agents. We review the papers that have addressed the allocation problem using cooperative game theory. We also relate the rules defined through cooperative games with rules defined directly from the problem, either through algorithms for computing a minimal tree, either through a cone-wise decomposition.
Subjects: 
Minimum-cost spanning tree problems
Cooperative games
Algorithms
Core
Shapley value
JEL: 
C71
D63
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
565.73 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.