Safety of links with respect to the Myerson value for communication situations

Myerson value of directed hypergraphs

“…Li-Shan demonstrated that if a game is strictly convex, the corresponding graph link can be considered safe if and only if it represents a bridge. Therefore, the statement of this theorem is more accurate, and its proof is more straightforward compared to reported in [5].…”

“…However, there nonetheless exist games wherein one's payoff might affect those of others. To solve this problem, in 2020, Li-Shan defined the safety of a link and deduced the appropriate safety conditions in terms of the Myerson value [5]. Their findings imply that all bridges pertaining to a convex game are safe.…”