Algorithms for computing the folk rule in minimum cost spanning tree problems with groups

DOI10.1016/j.dam.2023.06.001zbMath1520.91035OpenAlexW4380841441MaRDI QIDQ6110599

A. González-Maestro, Silvia Lorenzo-Freire, José M. Alonso-Meijide

Publication date: 2 August 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.06.001

zbMATH Keywords

Shapley valuecooperative game theoryOwen valueminimum cost spanning tree problemsKruskal algorithm

Mathematics Subject Classification ID

Cooperative games (91A12) Multistage and repeated games (91A20)

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimum cost spanning tree problems with groups
• Additivity in minimum cost spanning tree problems
• Owen's coalitional value and aircraft landing fees
• Minimum cost spanning tree games and population monotonic allocation schemes.
• The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
• An axiomatic approach in minimum cost spanning tree problems with groups
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A fair rule in minimum cost spanning tree problems
• A new rule for source connection problems
• A polynomial expression for the Owen value in the maintenance cost game
• On cost allocation for a spanning tree: A game theoretic approach

This page was built for publication: Algorithms for computing the folk rule in minimum cost spanning tree problems with groups