The average tree solution for multi-choice forest games

DOI10.1007/s10479-012-1150-1zbMath1259.91027MaRDI QIDQ1761793

Aymeric Lardon, Eric Rémila, Philippe Solal, Sylvain Béal

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/28739/1/MPRA_paper_28739.pdf

zbMATH Keywords

multi-choice games; communication graph; hierarchical outcomes; average tree solution; (pre-)core

Mathematics Subject Classification ID

91A80: Applications of game theory

91A35: Decision theory for games

Related Items

Discounted tree solutions, A simple family of solutions for forest games, Characterization of the average tree solution and its kernel, Efficient extensions of communication values, Priority relations and cooperation with multiple activity levels, Marginalism, egalitarianism and efficiency in multi-choice games, The average tree permission value for games with a permission tree, Allocation rules for multi-choice games with a permission tree structure

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiency and collusion neutrality in cooperative games and networks
• A characterization of the average tree solution for tree games
• Values for rooted-tree and sink-tree digraph games and sharing a river
• Banzhaf measures for games with several levels of approval in the input and output
• The egalitarian solution for multichoice games
• Configuration values: Extensions of the coalitional Owen value
• Potential approach and characterizations of a Shapley value in multi-choice games
• Rooted-tree solutions for tree games
• Games with permission structures: The conjunctive approach
• Cooperative games with coalition structures
• Characterizations of a multi-choice value
• The multichoice coalition value
• A Shapley value for games with restricted coalitions
• Shapley value for multichoice cooperative games. I
• A new approach to the core and Weber set of multichoice games
• Games on lattices, multichoice games and the Shapley value: a new approach
• The average tree solution for cycle-free graph games
• Minimizing a Submodular Function on a Lattice
• Graphs and Cooperation in Games
• Cores and related solution concepts for multi-choice games
• A value for multichoice games