Minimum cost spanning tree problems as value sharing problems
From MaRDI portal
Publication:2689423
DOI10.1007/s00182-022-00818-zOpenAlexW3185475013MaRDI QIDQ2689423
Publication date: 10 March 2023
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00182-022-00818-z
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- Cores of combined games
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Sharing a minimal cost spanning tree: beyond the folk solution
- Additivity in minimum cost spanning tree problems
- Additive stable solutions on perfect cones of cooperative games
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- A generalization of obligation rules for minimum cost spanning tree problems
- A cost sharing example in which subsidies are necessary for stability
- On the set of extreme core allocations for minimal cost spanning tree problems
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- The optimistic \(TU\) game in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- Contributions to the Theory of Games (AM-28), Volume II
- On cost allocation for a spanning tree: A game theoretic approach
- The Nucleolus of a Characteristic Function Game
This page was built for publication: Minimum cost spanning tree problems as value sharing problems
