Rooted-tree solutions for tree games
type: Item
instance of: scholarly article
title: Rooted-tree solutions for tree games
zbMATH Open document ID: 1177.91055
author: Sylvain Béal
author: Eric Rémila
author: Philippe Solal
published in: European Journal of Operational Research
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5650834
zbMATH Keywords: average tree solution
zbMATH Keywords: communication structure
zbMATH Keywords: marginal contributions
zbMATH Keywords: random (order) values
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.07.023
OpenAlex ID: W2047241866
cites work: Convex multi-choice games: characterizations and monotonic allocation schemes
cites work: Games on lattices, multichoice games and the Shapley value: a new approach
cites work: The average tree solution for cycle-free graph games
cites work: Graphs and Cooperation in Games
cites work: Q5817870
cites work: Harsanyi power solutions for graph-restricted games
DOI: 10.1016/J.EJOR.2009.07.023
description: scientific article; zbMATH DE number 5650834