Computational complexity of a solution for directed graph cooperative games (Q384201)

From MaRDI portal
Revision as of 03:10, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of a solution for directed graph cooperative games
scientific article

    Statements

    Computational complexity of a solution for directed graph cooperative games (English)
    0 references
    0 references
    0 references
    27 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(\#P\)-complete
    0 references
    digraph game
    0 references
    average covering tree value
    0 references
    coalition
    0 references
    communication structure
    0 references
    linear extension
    0 references
    0 references