Values for rooted-tree and sink-tree digraphs games and sharing a river

Share/Save/Bookmark

Khmelnitskaya, A.B. (2010) Values for rooted-tree and sink-tree digraphs games and sharing a river. Theory and decision, 69 (4). pp. 657-669. ISSN 0040-5833

[img] PDF
Restricted to UT campus only
: Request a copy
173kB
Abstract:We introduce values for rooted-tree and sink-tree digraph games axiomatically and provide their explicit formula representation. These values may be considered as natural extensions of the lower equivalent and upper equivalent solutions for line-graph games studied in van den Brink et al. (Econ Theory 33:349–349, 2007). We study the distribution of Harsanyi dividends.We show that the problem of sharing a river with a delta or with multiple sources among different agents located at different levels along the riverbed can be embedded into the framework of a rooted-tree or sink-tree digraph game correspondingly.
Item Type:Article
Copyright:© 2010 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/82125
Official URL:http://dx.doi.org/10.1007/s11238-009-9141-7
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page