On the existence of efficient and fair extensions of communication values for connected graphs
Year of publication: |
September 2016
|
---|---|
Authors: | Béal, Sylvain ; Casajus, André ; Hüttner, Frank |
Published in: |
Economics letters. - Amsterdam [u.a.] : Elsevier, ISSN 0165-1765, ZDB-ID 717210-2. - Vol. 146.2016, p. 103-106
|
Subject: | Communication graph | Fairness | Efficiency | Efficient extension | Fair extension | Myerson value | Gerechtigkeit | Justice | Kooperatives Spiel | Cooperative game | Effizienz | Kommunikation | Communication | Graphentheorie | Graph theory | Allokationseffizienz | Allocative efficiency | Shapley-Wert | Shapley value | Transferierbarer Nutzen | Transferable utility |
-
An efficient and fair solution for communication graph games
Brink, René van den, (2011)
-
The component fairness solution for cycle-free graph games
Herings, Peter Jean-Jacques, (2005)
-
Centrality rewarding shapley and Myerson values for undirected graph games
Chmelnitskaja, Anna B., (2016)
- More ...
-
Solidarity within a fixed community
Béal, Sylvain, (2014)
-
Efficient extensions of the Myerson value
Béal, Sylvain, (2015)
-
Efficient extensions of communication values
Béal, Sylvain, (2018)
- More ...