The average covering tree value for directed graph games (Q2292145)
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: The average covering tree value for directed graph games |
scientific article; zbMATH DE number 7161786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average covering tree value for directed graph games |
scientific article; zbMATH DE number 7161786 |
Statements
The average covering tree value for directed graph games (English)
0 references
3 February 2020
0 references
TU game
0 references
directed communication structure
0 references
marginal contribution vector
0 references
Myerson value
0 references
average tree solution
0 references
stability
0 references
0.9292066
0 references
0.9111539
0 references
0 references
0.90219164
0 references
0.8974679
0 references
0.89266896
0 references
0.88974214
0 references
0.8827461
0 references
0.87876284
0 references
