Discounted tree solutions

DOI10.1016/j.dam.2016.11.013zbMath1354.05085OpenAlexW2290986861MaRDI QIDQ505415

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

Publication date: 23 January 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.013

zbMATH Keywords

weight function\(\delta\)-reducing agentdiscount parameterdiscounted tree solutionsgeneralized standardnessgraph gamesinvariance with respect to cone amalgamation

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution, Axiomatization of an allocation rule for ordered tree TU-games

Cites Work

• Unnamed Item
• Characterizations of weighted and equal division values
• Sequential sharing rules for river sharing problems
• Comparable characterizations of four solutions for permission tree games
• Characterization of the average tree solution and its kernel
• Implementation and axiomatization of discounted Shapley values
• Axiomatizations of a class of equal surplus sharing solutions for TU-games
• Rooted-tree solutions for tree games
• An axiomatization of the Banzhaf value
• The average tree solution for multi-choice forest games
• Tree, web and average web values for cycle-free directed graph games
• The average tree permission value for games with a permission tree
• On a class of solidarity values
• A strategic implementation of the average tree solution for cycle-free graph games
• Null or nullifying players: the difference between the Shapley value and equal division solutions
• The average tree solution for cycle-free graph games
• Implementing Efficient Egalitarian Equivalent Allocations
• Potential, Value, and Consistency
• Graphs and Cooperation in Games
• Bidding for the surplus: a non-cooperative approach to the Shapley value