On the existence of efficient and fair extensions of communication values for connected graphs
| Affiliation auteurs | Affiliation ok |
| Titre | On the existence of efficient and fair extensions of communication values for connected graphs |
| Type de publication | Journal Article |
| Year of Publication | 2016 |
| Auteurs | Beal S, Casajus A, Huettner F |
| Journal | ECONOMICS LETTERS |
| Volume | 146 |
| Pagination | 103-106 |
| Date Published | SEP |
| Type of Article | Article |
| ISSN | 0165-1765 |
| Mots-clés | Communication graph, Efficiency, Efficient extension, Fair extension, Fairness, Myerson value |
| Résumé | 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. (C) 2016 Elsevier B.V. All rights reserved. |
| DOI | 10.1016/j.econlet.2016.07.030 |