Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6119213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases |
scientific article; zbMATH DE number 6119213 |
Statements
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (English)
0 references
28 December 2012
0 references
Shapley value
0 references
cooperative game
0 references
computational complexity
0 references
0 references
0 references
0 references
0.8249128460884094
0 references
0.8160508275032043
0 references
0.8149202466011047
0 references
0.8114749193191528
0 references
