Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86843
Authors: 
van den Brink, Rene
Khmelnitskaya, Anna
van der Laan, Gerard
Year of Publication: 
2011
Series/Report no.: 
Tinbergen Institute Discussion Paper 11-052/1
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 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.
Subjects: 
TU game
communication graph
Myerson value
fairness
efficiency
JEL: 
C71
Document Type: 
Working Paper

Files in This Item:
File
Size
234.33 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.