Three-person spanning tree games (Q1596863)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Three-person spanning tree games	scientific article

Statements

scholarly article

0 references

Three-person spanning tree games (English)

0 references

Mathematical and Computer Modelling

0 references

publication date

5 May 2002

0 references

zbMATH Keywords

\(\tau\)-value

0 references

core

0 references

nucleolus

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

On cost allocation for a spanning tree: A game theoretic approach

0 references

0 references

An axiomatization of the \(\tau\)-value

0 references

Cost allocation for a spanning tree

0 references

Minimum cost spanning tree games

0 references

On the core and nucleolus of minimum cost spanning tree games

0 references

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

0 references

Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree

0 references

The irreducible Core of a minimum cost spanning tree game

0 references

The minimum cost spanning forest game

0 references

Proof of permutationally convexity of MCSF games

0 references

The \(\tau\)-value, the core and semiconvex games

0 references

Minimarg and maximarg operators

0 references

full work available at URL

https://doi.org/10.1016/s0895-7177(98)00181-2

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0895-7177(98)00181-2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1596863

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1596863&oldid=36990883"