Three-person spanning tree games

DOI10.1016/S0895-7177(98)00181-2zbMath0992.91008OpenAlexW2075347289MaRDI QIDQ1596863

Bahram Alidaee

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(98)00181-2

zbMATH Keywords

corenucleolus\(\tau\)-value

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• The minimum cost spanning forest game
• The \(\tau\)-value, the core and semiconvex games
• An axiomatization of the \(\tau\)-value
• Minimarg and maximarg operators
• The irreducible Core of a minimum cost spanning tree game
• On the core and nucleolus of minimum cost spanning tree 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
• Proof of permutationally convexity of MCSF games

This page was built for publication: Three-person spanning tree games