The covering values for acyclic digraph games (Q647347): Difference between revisions

@@ Property / DOI @@
-.1007/s00182-010-0264-4
@@ Property / DOI: 10.1007/s00182-010-0264-4 / rank @@
-Normal rank
@@ Property / cites work @@
+The Shapley value for cooperative games under precedence constraints
+Normal rank
@@ Property / cites work @@
+Games with permission structures: The conjunctive approach
+Normal rank
@@ Property / cites work @@
+The average tree solution for cycle-free graph games
+Normal rank
@@ Property / cites work @@
+Values for rooted-tree and sink-tree digraph games and sharing a river
+Normal rank
@@ Property / cites work @@
+Q3059253
@@ Property / cites work: Q3059253 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs and Cooperation in Games
@@ Property / cites work: Graphs and Cooperation in Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q5817870
@@ Property / cites work: Q5817870 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatization of the disjunctive permission value for games with a permission structure
+Normal rank
@@ Property / cites work @@
+Component efficient solutions in line-graph games with applications
+Normal rank
@@ Property / DOI @@
+.1007/S00182-010-0264-4
@@ Property / DOI: 10.1007/S00182-010-0264-4 / rank @@
+Normal rank