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

Research output: Book/ReportReportProfessional

14 Downloads (Pure)

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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages12
Publication statusPublished - Sep 2008

Publication series

NameMemorandum of the Department of Applied Mathematics
No.1874
ISSN (Print)1874-4850

Keywords

  • IR-64955
  • METIS-256119
  • EWI-13382

Cite this