Values for rooted-tree and sink-tree digraph games and sharing a river
From MaRDI portal
Publication:708937
DOI10.1007/S11238-009-9141-7zbMath1232.91030OpenAlexW2165207507WikidataQ59663903 ScholiaQ59663903MaRDI QIDQ708937
Publication date: 15 October 2010
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-009-9141-7
TU gameMyerson valuecomponent efficiencycooperation structuredeletion link propertyHarsanyi dividendssharing a river
Related Items (20)
Axiomatization of an allocation rule for ordered tree TU-games ⋮ Values for games with two-level communication structures ⋮ Polluted river problems and games with a permission structure ⋮ The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations ⋮ Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems ⋮ Sequential sharing rules for river sharing problems ⋮ Two-step values for games with two-level communication structure ⋮ The covering values for acyclic digraph games ⋮ Unnamed Item ⋮ Compensations in the Shapley value and the compensation solutions for graph games ⋮ Responsibility and sharing the cost of cleaning a polluted river ⋮ Independence of downstream and upstream benefits in river water allocation problems ⋮ The core of games on ordered structures and graphs ⋮ Tree, web and average web values for cycle-free directed graph games ⋮ The average tree solution for multi-choice forest games ⋮ Allocating the costs of cleaning a river: expected responsibility versus median responsibility ⋮ The average covering tree value for directed graph games ⋮ THE RIVER SHARING PROBLEM: A SURVEY ⋮ Sharing the costs of cleaning a river: the upstream responsibility rule ⋮ Composition properties in the river claims problem
Cites Work
This page was built for publication: Values for rooted-tree and sink-tree digraph games and sharing a river
