Tree, web and average web value for cycle-free directed graph games

Share/Save/Bookmark

Khmelnitskaya, Anna and Talman, Dolf (2011) Tree, web and average web value for cycle-free directed graph games. [Report]

[img]
Preview
PDF
308Kb
Abstract:On the class of cycle-free directed graph games with transferable utility solution concepts, called web values, are introduced axiomatically, each one with respect to some specific choice of a management team of the graph. We provide their explicit formula representation and simple recursive algorithms to calculate them. Additionally the efficiency and stability of web values are studied. Web values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph games. In case the management team consists of all sources (sinks) in the graph a kind of tree (sink) value is obtained. In general, at a web value each player receives the worth of this player together with his subordinates minus the total worths of these subordinates. It implies that every coalition of players consisting of a player with all his subordinates receives precisely its worth. We also define the average web value as the average of web values over all management teams in the graph. As application the water distribution problem of a river with multiple sources, a delta and possibly islands is considered.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/78447
Publisher URL:http://www.math.utwente.nl/publications
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 279693