A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems
ISSN: 1869-4195
Année de publication: 2021
Volumen: 12
Número: 1
Pages: 73-100
Type: Article
D'autres publications dans: SERIEs : Journal of the Spanish Economic Association
Résumé
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.
Information sur le financement
Financeurs
-
Ministerio de Economía y Competitividad
- ECO2017-82241-R
-
Xunta de Galicia
- ED431B 2019/34