Myerson value of directed hypergraphs

Abstract

This paper presents directed hypergraphs as cooperative networks and defines their Myerson value. The axiomatization of the Myerson value, i.e., strong component efficiency and fairness, has been demonstrated. Furthermore, the concept of safety, as defined by Li and Shan, has been modified, and the hyperedge safety condition is proven in terms of the Myerson value of directed hypergraphs.