Myerson value of directed hypergraphs

10/13/2021
by   Taiki Yamada, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2019

PageRank algorithm for Directed Hypergraph

During the last two decades, we easilly see that the World Wide Web's li...
research
10/04/2019

A Note on Directed Treewidth

We characterise digraphs of directed treewidth one in terms of forbidden...
research
08/09/2020

Directed hypergraph neural network

To deal with irregular data structure, graph convolution neural networks...
research
04/10/2020

The giant component of the directed configuration model revisited

We prove a law of large numbers for the order and size of the largest st...
research
12/02/2021

Wearable Affective Memory Augmentation

Human memory prioritizes the storage and recall of information that is e...
research
02/01/2019

On the Bias of Directed Information Estimators

When estimating the directed information between two jointly stationary ...
research
08/04/2023

Game theoretic foundations of the Gately power measure for directed networks

We introduce a new network centrality measure founded on the Gately valu...

Please sign up or login with your details

Forgot password? Click here to reset