Economics at your fingertips  

A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems

Gustavo Bergantiños and Juan Vidal-Puga

SERIEs: Journal of the Spanish Economic Association, 2021, vol. 12, issue 1, No 4, 73-100

Abstract: 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.

Keywords: Minimum-cost spanning tree problems; Cooperative games; Algorithms; Core; Shapley value (search for similar items in EconPapers)
JEL-codes: C71 D63 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2) Track citations by RSS feed

Downloads: (external link) Abstract (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from

DOI: 10.1007/s13209-021-00230-y

Access Statistics for this article

SERIEs: Journal of the Spanish Economic Association is currently edited by Nezih Guner

More articles in SERIEs: Journal of the Spanish Economic Association from Springer, Spanish Economic Association Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Page updated 2023-04-22
Handle: RePEc:spr:series:v:12:y:2021:i:1:d:10.1007_s13209-021-00230-y