New allocation rule of directed hypergraphs

From MaRDI portal
Revision as of 09:19, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6380171

arXiv2110.06506MaRDI QIDQ6380171

Author name not available (Why is that?)

Publication date: 13 October 2021

Abstract: The Shapley value, one of the well-known allocation rules in game theory, does not take into account information about the structure of the graph, so by using the Shapley value for each hyperedge, we introduce a new allocation rule by considering their first-order combination. We proved that some of the properties that hold for Shapley and Myerson values also hold for our allocation rule. In addition, we found the relationship between our allocation rule and the Forman curvature, which plays an important role in discrete geometry.




Has companion code repository: https://github.com/taiki-yamada-math/combinatorialevaluation

No records found.








This page was built for publication: New allocation rule of directed hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380171)