Characterization of the average tree solution and its kernel

DOI10.1016/J.JMATECO.2015.07.001MaRDI QIDQ745019zbMATH OpenOpenAlexFDO

Authors Sylvain Béal, Eric Rémila, Philippe Solal

Publication date 12 October 2015

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://crese.univ-fcomte.fr/uploads/wp/WP-2014-04.pdf

zbMATH Keywords

inverse problemkernelaverage tree solutiondirect-sum decompositioninvariance to irrelevant coalitionsweighted addition invariance on bi-partitions

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• A characterization of the average tree solution for tree games
• Comparable axiomatizations of the average tree solution and the Myerson value
• Publication:4730334
• Kernels and Grundy functions on trees
• scientific article; zbMATH DE number 1188119
• Approximate tree kernels
• A study of the spectrum for certain kernels on a tree
• On the kernel of tree incidence matrices
• Kernelizing MSO properties of trees of fixed height, and some consequences
• Some average measures in m-ary search trees

Cites work

• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• A characterization of the average tree solution for tree games
• A decomposition of the space of TU-games using addition and transfer invariance
• A strategic implementation of the average tree solution for cycle-free graph games
• Average tree solutions and the distribution of Harsanyi dividends
• Axiomatizations of two types of Shapley values for games on union closed systems
• Axioms of invariance for TU-games
• Decomposition of the space of TU-games, strong transfer invariance and the Banzhaf value
• Efficiency and collusion neutrality in cooperative games and networks
• Equivalent N-Person Games and the Null Space of the Shapley Value
• Graphs and Cooperation in Games
• Rooted-tree solutions for tree games
• The average tree permission value for games with a permission tree
• The average tree solution for cooperative games with communication structure
• The average tree solution for cycle-free graph games
• The average tree solution for multi-choice forest games
• Value, consistency, and random coalition formation
• Weak addition invariance and axiomatization of the weighted Shapley value
• Weighted component fairness for forest games

Cited in

(8)

• Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations
• Characterizations of weighted and equal division values
• Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution
• On the inverse problem for a subclass of linear, symmetric and efficient values of cooperative TU games
• Comparable axiomatizations of the average tree solution and the Myerson value
• Rooted-tree solutions for tree games
• Some advances in cooperative game theory: indivisibilities, externalities and axiomatic approach
• Discounted tree solutions

This page was built for publication: Characterization of the average tree solution and its kernel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745019)