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

A. Khmelnitskaya, A.J.J. Talman

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)


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 a chosen coalition of players that is assumed to be an anti-chain in the directed graph and is considered as a management team. 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.
Original languageEnglish
Pages (from-to)233-246
JournalEuropean Journal of Operational Research
Publication statusPublished - 2014


Dive into the research topics of 'Tree, web and average web values for cycle-free directed graph games'. Together they form a unique fingerprint.

Cite this