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

  1. Gustavo Bergantiños
  2. Juan Vidal-Puga
SERIEs : Journal of the Spanish Economic Association

ISSN: 1869-4195

Ano de publicación: 2021

Volume: 12

Número: 1

Páxinas: 73-100

Tipo: Artigo

DOI: 10.1007/S13209-021-00230-Y DIALNET GOOGLE SCHOLAR lock_openAcceso aberto editor

Outras publicacións en: SERIEs : Journal of the Spanish Economic Association


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.

Información de financiamento