Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
DOI10.1016/J.DAM.2017.03.007zbMATH Open1414.91018OpenAlexW2606528734MaRDI QIDQ528547FDOQ528547
Authors: Kazutoshi Ando, Ryosuke Inagaki, Kazuya Shoji 
Publication date: 12 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.007
Recommendations
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- Submodularity of minimum-cost spanning tree games
Cooperative games (91A12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Sharing a minimal cost spanning tree: beyond the folk solution
- On cost allocation for a spanning tree: A game theoretic approach
- A fair rule in minimum cost spanning tree problems
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Minimum cost forest games
This page was built for publication: Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528547)
