Total balancedness condition for Steiner tree games.
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.
scientific article; zbMATH DE number 1925258