The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games

DOI10.1137/0603029zbMath0498.90094OpenAlexW2062590042MaRDI QIDQ3964354

Gur Huberman, Daniel Granot

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603029

zbMATH Keywords

core of a gameconvex gameminimum cost spanning tree gamepermutationally convex games

Mathematics Subject Classification ID

Cooperative games (91A12) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (27)

Sequencing games with controllable processing times ⋮ The socially stable core in structured transferable utility games ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Component efficient solutions in line-graph games with applications ⋮ Communication and its cost in graph-restricted games ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Minimum cost forest games ⋮ Proof of permutationally convexity of MCSF games ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ A bankruptcy problem and an information trading problem: Applications tok-convex games ⋮ The minimum cost spanning forest game ⋮ Inventory games. ⋮ \(p\)-additive games: a class of totally balanced games arising from inventory situations with temporary discounts ⋮ Monotonicity of solutions in certain dynamic cooperative games ⋮ A note on the permutationally convex games ⋮ A core-allocation family for generalized holding cost games ⋮ On the core and nucleolus of minimum cost spanning tree games ⋮ The average tree solution for cycle-free graph games ⋮ COLLECTING INFORMATION TO IMPROVE DECISION-MAKING ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ The average tree solution for cooperative games with communication structure ⋮ An efficient characterization of submodular spanning tree games ⋮ Network flow problems and permutationally concave games ⋮ A necessary and sufficient condition for the convexity in oligopoly games ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Three-person spanning tree games ⋮ The irreducible Core of a minimum cost spanning tree game

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A simple expression for the nucleolus in a special case
• Cores of convex games
• The kernel and bargaining set for convex games
• Minimum cost spanning tree 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

This page was built for publication: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games