Three-person spanning tree games

DOI10.1016/S0895-7177(98)00181-2MaRDI QIDQ1596863zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Spanning-tree games
• The Stackelberg minimum spanning tree game
• The Stackelberg Minimum Spanning Tree Game
• Generalized minimum spanning tree games
• On three-player potential games
• Spanning tree game as prim would have played
• The Lattice Structure of Three-Player Games
• Domination game played on trees and spanning subgraphs
• A 3-person game on polyhedral sets

Cites work

• scientific article; zbMATH DE number 3728058 (Why is no real title available?)
• An axiomatization of the -value
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Cost allocation for a spanning tree
• Minimarg and maximarg operators
• Minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• Proof of permutationally convexity of MCSF games
• The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
• The \(\tau\)-value, the core and semiconvex games
• The irreducible Core of a minimum cost spanning tree game
• The minimum cost spanning forest game

Cited in

(1)

• Tree-connected peer group situations and peer group games

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

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