Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s13160-012-0078-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035507135 / rank | |||
Normal rank | |||
Revision as of 02:29, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases |
scientific article |
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
