On the existence of efficient and fair extensions of communication values for connected graphs

C-Tier

Journal: Economics Letters

Year: 2016

Volume: 146

Issue: C

Pages: 103-106

Authors (3)

Béal, Sylvain (Université de Franche-Comté) Casajus, André (not in RePEc) Huettner, Frank (not in RePEc)

Score contribution per author:

0.335 = (α=2.01 / 3 authors) × 0.5x C-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

View Full Article View on IDEAS/RePEc

Abstract

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.

On the existence of efficient and fair extensions of communication values for connected graphs

Authors (3)

Abstract

Technical Details