On cycle-free accessible union stable network structures

DOI10.1007/S10288-025-00594-YMaRDI QIDQ6921068zbMATH OpenFDO

Authors Encarnación Algaba, René van den Brink, Chris Dietz

Publication date 6 October 2025

Published in 4OR (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10288-025-00594-Y

zbMATH Keywords

accessible union stable structureaxiomatizationcooperative gamecycle-free graphShapley value

Mathematics Subject Classification ID

Flows in graphs (05C21) Cooperative games (91A12) Games involving graphs (91A43)

Cites work

• A value for games restricted by augmenting systems
• An axiomatization of the disjunctive permission value for games with a permission structure
• Axiomatizations of the conjunctive permission value for games with permission structures
• Axiomatizations of the Shapley value for cooperative games on antimatroids
• Conference structures and fair allocation rules
• Cooperative games on antimatroids
• Cooperative Games under Augmenting Systems
• Cores of partitioning games
• Equivalence theorem, consistency and axiomatizations of a multi-choice value
• Games with a permission structure -- a survey on generalizations and applications
• Games with permission structures: The conjunctive approach
• Graphs and Cooperation in Games
• Greedoids
• Harsanyi power solutions for games on union stable systems
• Harsanyi power solutions for graph-restricted games
• scientific article; zbMATH DE number 3138565 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Intermediate preferences and stable coalition structures
• Lattices with unique irreducible decompositions
• Monge extensions of cooperation and communication structures
• Network structures with hierarchy and communication
• Networks, communication and hierarchy: applications to cooperative games
• On hierarchies and communication
• Parameterized fairness axioms on cycle-free graph games
• Power measures and solutions for games under precedence constraints
• Strongly balanced cooperative games
• The average tree solution for cycle-free graph games
• The cooperative game theory of networks and hierarchies
• The Myerson value and superfluous supports in union stable systems
• The Myerson value for union stable structures
• The position value for union stable systems
• The position value in communication structures.
• The Shapley value for cooperative games under precedence constraints
• The theory of convex geometries
• Values of Graph-Restricted Games

This page was built for publication: On cycle-free accessible union stable network structures

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