Myerson value of directed hypergraphs
Taiki Yamada · arXiv (Cornell University) · 2021
In this paper, we consider a directed hypergraph as cooperative network, and define the Myerson value for directed hypergraphs. We prove the axiomatization of the Myerson value, namely strong component efficiency and fairness. Moreover, we modified the concept of safety defined by Li-Shan, and proved the condition about the safety of the hyperedge with respect to the Myerson value for directed hypergraphs.