Munich Personal RePEc Archive

Cooperative games for minimum cost spanning tree problems

Bergantiños, Gustavo and Vidal-Puga, Juan (2020): Cooperative games for minimum cost spanning tree problems.

[img]
Preview
PDF
MPRA_paper_104911.pdf

Download (436kB) | Preview

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.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.