Total balancedness condition for Steiner tree games. (Q1811075)
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 1925258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total balancedness condition for Steiner tree games. |
scientific article; zbMATH DE number 1925258 |
Statements
Total balancedness condition for Steiner tree games. (English)
0 references
10 June 2003
0 references
The authors consider and study the Steiner tree game. It has been shown that it is NP-hard to determine whether a Steiner tree game is balanced. The NP-hardness result is also established for deciding whether the core is non-empty or whether an imputation is a member of the core.
0 references
cooperative games
0 references
Steiner tree
0 references
core
0 references
total balancedness
0 references
NP-hard
0 references
0.8110962510108948
0 references
0.7823739051818848
0 references
0.7787297964096069
0 references
