Weighted allocation rules for standard fixed tree games

DOI10.1007/S001860300324MaRDI QIDQ1762673zbMATH OpenOpenAlexFDO

Authors Endre Bjørndal, Maurice Koster, Stef Tijs

Publication date 11 February 2005

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://pure.uvt.nl/ws/files/532660/79.pdf

zbMATH Keywords

Core

Mathematics Subject Classification ID

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

Review text

The authors develop weighted allocation rules for standard fixed tree games. A number of theorems and proofs are developed for the foundation of the proposed theory but no experiments are performed for its validation. It is an interesting theoretic paper for the reader and researchers in game theory.

Recommendations

• Standard fixed tree game and its applications to water management problems
• Weighted component fairness for forest games
• Axiomatization of an allocation rule for ordered tree TU-games
• The weighted-egalitarian Shapley values
• Allocation rules for network games

Cited in

(7)

• Operations research games: A survey. (With comments and rejoinder)
• Axiomatization of an allocation rule for ordered tree TU-games
• The eigen-distribution of weighted game trees
• Some new results on generalized additive games
• Standard fixed tree game and its applications to water management problems
• On the core and nucleolus of directed acyclic graph games
• Sharing cost of network among users with differentiated willingness to pay

This page was built for publication: Weighted allocation rules for standard fixed tree games

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