Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/286530 
Erscheinungsjahr: 
2021
Quellenangabe: 
[Journal:] SERIEs - Journal of the Spanish Economic Association [ISSN:] 1869-4195 [Volume:] 12 [Issue:] 1 [Year:] 2021 [Pages:] 73-100
Verlag: 
Springer, Heidelberg
Zusammenfassung: 
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.
Schlagwörter: 
Minimum-cost spanning tree problems
Cooperative games
Algorithms
Core
Shapley value
JEL: 
C71
D63
Persistent Identifier der Erstveröffentlichung: 
Creative-Commons-Lizenz: 
cc-by Logo
Dokumentart: 
Article

Datei(en):
Datei
Größe
565.73 kB





Publikationen in EconStor sind urheberrechtlich geschützt.