Communication and its cost in graph-restricted games

DOI10.1007/BF00133166zbMath0652.90106MaRDI QIDQ1107455

Edward C. Rosenthal

Publication date: 1988

Published in: Theory and Decision (Search for Journal in Brave)

zbMATH Keywords

cooperative games; graphs; subordination to communication networks

Mathematics Subject Classification ID

91A12: Cooperative games

Related Items

Bargaining power in communication networks, Coalition formation under limited communication, The Shapley value for cooperative games under precedence constraints, A value with incomplete communication, Monotonicity of the core and value in dynamic cooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum cost spanning forest game
• Cores of convex games
• The assignment game. I: The core
• Totally balanced games arising from controlled programming problems
• A generalized linear production model: A unifying model
• Values of Graph-Restricted Games
• Minimum cost spanning tree games
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• On the core of linear production games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Graphs and Cooperation in Games
• Activity selection games and the minimum‐cut problem