The average covering tree value for directed graph games
Khmelnitskaya, Anna and Selcuk, Özer and Talman, Dolf (2012) The average covering tree value for directed graph games. [Report]

PDF
212kB 
Abstract:  We introduce a singlevalued solution concept, the socalled average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on the set of players that preserve the dominance relations between the players prescribed by the directed graph. The average covering tree value is component efficient and under a particular convexitytype condition is stable. For transferable utility games with complete communication structure the average covering tree value equals to the Shapley value of the game. If the graph is the directed analog of an undirected graph the average covering tree value coincides with the gravity center solution. 
Item Type:  Report 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/80404 
Publisher URL:  http://www.math.utwente.nl/publications 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page