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

Sylvain Béal, André Casajus and Frank Huettner

Economics Letters, 2016, vol. 146, issue C, 103-106

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.

Keywords: Communication graph; Fairness; Efficiency; Efficient extension; Fair extension; Myerson value (search for similar items in EconPapers)
JEL-codes: C71 D60 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165176516302786
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ecolet:v:146:y:2016:i:c:p:103-106

DOI: 10.1016/j.econlet.2016.07.030

Access Statistics for this article

Economics Letters is currently edited by Economics Letters Editorial Office

More articles in Economics Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().