Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641)

From MaRDI portal
Revision as of 10:27, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
scientific article

    Statements

    Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (English)
    0 references
    0 references
    28 December 2012
    0 references
    Shapley value
    0 references
    cooperative game
    0 references
    computational complexity
    0 references

    Identifiers