Back to University of Twente portal
Values for rooted-tree and sink-tree digraphs games and sharing a river
Khmelnitskaya, Anna B. (2008) Values for rooted-tree and sink-tree digraphs games and sharing a river. [Report]
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 141Kb |
| 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 Brink, Laan, and Vasil'ev (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: | Report |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/64955 |
| Publisher URL: | http://www.math.utwente.nl/publications |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page
Metis ID: 256119