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

Theory and Decision 69 (4):657-669 (2010)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.
Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.
An $mathbb{S}_{max}$ Variation for One Souslin Tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81-98.
Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.

Analytics

Added to PP
2013-12-01

Downloads
88 (#189,215)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?