Parameterized fairness axioms on cycle-free graph games

DOI10.1007/S10898-011-9761-7zbMATH Open1243.91007OpenAlexW2069793843MaRDI QIDQ427375FDOQ427375

Authors: S. Ryuo, Yoshitsugu Yamamoto, Keisuke Sato 

Publication date: 13 June 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://tsukuba.repo.nii.ac.jp/record/27078/files/JGO_52-3.pdf

Recommendations

• The average tree solution for cycle-free graph games
• Tree solutions and standardness for cycle-free graph games
• An axiomatization of the Myerson value
• Comparable axiomatizations of the average tree solution and the Myerson value
• Component-wise proportional solutions for communication graph games

zbMATH Keywords

fairnessTU-gamecommunication structurecycle-free graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of the position value
• A one-stage model of link formation and payoff division
• AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
• Conference structures and fair allocation rules
• Graphs and Cooperation in Games
• On the Position Value for Communication Situations
• Pareto optimality, game theory and equilibria
• The average tree solution for cooperative games with communication structure
• The average tree solution for cycle-free graph games

Cited In (3)

• Component-wise proportional solutions for communication graph games
• An efficient and fair solution for communication graph games
• Tree solutions and standardness for cycle-free graph games

This page was built for publication: Parameterized fairness axioms on cycle-free graph games

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