Computational complexity of a solution for directed graph cooperative games (Q384201): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting linear extensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Cooperative Solution Concepts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Shapley value for cooperative games under precedence constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5817870 / rank | |||
Normal rank | |||
Latest revision as of 03:10, 7 July 2024
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
27 November 2013
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
