On the existence of efficient and fair extensions of communication values for connected graphs
- We study values for TU games with a communication graph (CO-values). In particular, we show that CO-values for connected graphs that are fair and efficient allow for a unique efficient and fair extension to the full domain.
| Document Type: | Article |
|---|---|
| Language: | English |
| Author: | Sylvain Béal, André Casajus, Frank Huettner |
| Chairs and Professorships: | Chair of Economics and Information Systems |
| DOI: | https://doi.org/10.1016/j.econlet.2016.07.030 |
| Year of Completion: | 2016 |
| Note: | In: Economics Letters, 146 (2016) September, 103-106 |