A responsibility value for digraphs
There is an increasing need to hold players responsible for negative or positive impact that take place elsewhere in a value chain or a network. For example, countries or companies are held more and more responsible for their indirect carbon emissions. We introduce a responsibility value that allocates the total impact of the value chain among the players, taking into account their direct impact and their indirect impact through the underlying graph. Moreover, we show that the responsibility value satisfies a set of natural yet important properties.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Responsibility in a Multi-Value Strategic Setting
Responsibility is a key notion in multi-agent systems and in creating safe, reliable and ethical AI. However, most previous work on responsibility has only considered responsibility for single outcomes. In this paper we …
Graph Learning in 4D: a Quaternion-valued Laplacian to Enhance Spectral GCNs
We introduce QuaterGCN, a spectral Graph Convolutional Network (GCN) with quaternion-valued weights at whose core lies the Quaternionic Laplacian, a quaternion-valued Laplacian matrix by whose proposal we generalize two …
Graph LearningHermitian matrices for clustering directed graphs: insights and applications
Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance …
ClusteringGraph ClusteringStochastic Block ModelTransition-Based Coding and Formal Language Theory for Ordered Digraphs
Transition-based parsing of natural language uses transition systems to build directed annotation graphs (digraphs) for sentences. In this paper, we define, for an arbitrary ordered digraph, a unique decomposition and a …
Are the flows of complex-valued Laplacians and their pseudoinverses related?
Laplacian flows model the rate of change of each node's state as being proportional to the difference between its value and that of its neighbors. Typically, these flows capture diffusion or synchronization dynamics and …