Computational complexity of a solution for directed graph cooperative games (Q384201)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of a solution for directed graph cooperative games |
scientific article; zbMATH DE number 6233800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of a solution for directed graph cooperative games |
scientific article; zbMATH DE number 6233800 |
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
0.8530179262161255
0 references
0.809988796710968
0 references
0.7942965626716614
0 references
0.7826279997825623
0 references
0.7796786427497864
0 references
