An efficient and fair solution for communication graph games

Rene van den Brink (), Anna Khmelnitskaya and Gerard van der Laan

Economics Letters, 2012, vol. 117, issue 3, 786-789

Abstract: We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus.

Keywords: Game theory; TU game; Communication graph; Myerson value (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165176512004612
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:117:y:2012:i:3:p:786-789

DOI: 10.1016/j.econlet.2012.08.026

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 ().