scientific article; zbMATH DE number 7274136

MaRDI QIDQ5133141zbMATH OpenFDO

Authors Kazutoshi Ando, Koichi Takase

Publication date 12 November 2020

zbMATH Keywords

algorithmcooperative gamegame theoryminimum cost spanning treeShapley value

Mathematics Subject Classification ID

Cooperative games (91A12)

Recommendations

• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Multi-criteria minimum cost spanning tree games
• Fair cost-sharing methods for the minimum spanning tree game
• Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
• A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
• A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
• Cost monotonicity, consistency and minimum cost spanning tree games
• scientific article; zbMATH DE number 5666824

Cited in

(3)

• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
• Monte Carlo methods for the Shapley-Shubik power index
• A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133141)