Proof of permutationally convexity of MCSF games

DOI10.1007/BF01415584zbMath0803.90136MaRDI QIDQ4296297

Bahram Alidaee

Publication date: 19 June 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

minimum cost spanning treepermutationally convex gameminimum cost spanning forest

Mathematics Subject Classification ID

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

Related Items

Network flow problems and permutationally concave games ⋮ Three-person spanning tree games

Cites Work

• The minimum cost spanning forest game
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A note on the permutationally convex games
• Cores of convex games
• Minimum cost spanning tree games
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex 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