An Efficient and Fair Solution for Communication Graph Games

Rene van den Brink (), Anna Khmelnitskaya and Gerard van der Laan
Additional contact information
Anna Khmelnitskaya: Russian Academy of Sciences, St Petersburg, Russia

No 11-052/1, Tinbergen Institute Discussion Papers from Tinbergen Institute

Abstract: This discussion paper resulted in a publication in 'Economics Letters' , 2012, 117, 786-789.

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 component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when applying the solution to the subgame induced by this component.

Keywords: TU game; communication graph; Myerson value; fairness; efficiency (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2011-03-14
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://papers.tinbergen.nl/11052.pdf (application/pdf)

Related works:
Journal Article: An efficient and fair solution for communication graph games (2012)
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:tin:wpaper:20110052

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute Contact information at EDIRC.
Bibliographic data for series maintained by Tinbergen Office +31 (0)10-4088900 ().