Tree-type values for cycle-free directed graph games

Share/Save/Bookmark

Khmelnitskaya, Anna and Talman, Dolf (2010) Tree-type values for cycle-free directed graph games. [Report]

[img]
Preview
PDF
226Kb
Abstract:For arbitrary cycle-free directed graph games tree-type values are introduced axiomatically and their explicit formula representation is provided. These 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. The main property for the tree value is that every player in the game receives the worth of this player together with his successors minus what these successors receive. It implies that every coalition of players consisting of one of the players with all his successors receives precisely its worth. Additionally their efficiency and stability are studied. Simple recursive algorithms to calculate the values are also provided. The application to 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/73838
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: 277436