Values for rooted-tree and sink-tree digraph games and sharing a river
Year of publication: |
2010
|
---|---|
Authors: | Khmelnitskaya, Anna |
Published in: |
Theory and Decision. - Springer. - Vol. 69.2010, 4, p. 657-669
|
Publisher: |
Springer |
Subject: | TU game | Cooperation structure | Myerson value | Component efficiency | Deletion link property | Harsanyi dividends | Sharing a river |
-
Tree-Type Values for Cycle-Free Directed Graph Games
Talman, Dolf, (2010)
-
Tree, Web and Average Web Value for Cycle-Free Directed Graph Games
Talman, Dolf, (2011)
-
Component efficient solutions in line-graph games with applications
Brink, René, (2007)
- More ...
-
An Efficient and Fair Solution for Communication Graph Games
van den Brink, Rene, (2011)
-
An Owen-Type Value for Games with Two-Level Communication Structures
van den Brink, Rene, (2011)
-
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs
Khmelnitskaya, Anna, (2016)
- More ...