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

Research output: Contribution to journalArticleAcademicpeer-review

29 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)657-669
Number of pages13
JournalTheory and decision
Volume69
Issue number4
DOIs
Publication statusPublished - 2010

Keywords

  • Myerson value
  • Component efficiency
  • TU game
  • Cooperation structure
  • Deletion link property
  • Harsanyi dividends
  • Sharing a river

Fingerprint Dive into the research topics of 'Values for rooted-tree and sink-tree digraphs games and sharing a river'. Together they form a unique fingerprint.

Cite this