On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.econlet.2016.07.030
-Normal rank
@@ Property / OpenAlex ID @@
-W2476384752
@@ Property / OpenAlex ID: W2476384752 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.econlet.2016.07.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2476384752
@@ Property / OpenAlex ID: W2476384752 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient extensions of the Myerson value
@@ Property / cites work: Efficient extensions of the Myerson value / rank @@
+Normal rank
@@ Property / cites work @@
+Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions
+Normal rank
@@ Property / cites work @@
+A matrix approach to TU games with coalition and communication structures
+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 efficient and fair solution for communication graph games
+Normal rank