Proof of permutationally convexity of MCSF games

DOI10.1007/BF01415584MaRDI QIDQ4296297zbMATH OpenFDO

Authors Bahram Alidaee

Publication date 19 June 1994

Published in ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01415584

zbMATH Keywords

minimum cost spanning forestminimum cost spanning treepermutationally convex game

Mathematics Subject Classification ID

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

Recommendations

• Multi-criteria minimum cost spanning tree games
• Submodularity of minimum-cost spanning tree games
• SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES
• The minimum cost spanning forest game
• Minimum cost forest games

Cites work

• A note on the permutationally convex games
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Cores of convex games
• Cost allocation for a spanning tree
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The minimum cost spanning forest game
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games

Cited in

(2)

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

This page was built for publication: Proof of permutationally convexity of MCSF games

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