Network flow problems and permutationally concave games
type: Item
instance of: scholarly article
title: Network flow problems and permutationally concave games
zbMATH Open document ID: 1176.91009
author: Christian Trudeau
published in: Mathematical Social Sciences
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 5642982
zbMATH Keywords: stability
zbMATH Keywords: core
zbMATH Keywords: network
zbMATH Keywords: concavity
MaRDI profile type: Publication
full work available at URL: j.mathsocsci.2009.01.002
OpenAlex ID: W1973794372
cites work: Proof of permutationally convexity of MCSF games
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: Q3471888
cites work: Q5493452
cites work: Cost monotonicity, consistency and minimum cost spanning tree games
cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP
cites work: Congestion network problems and related games
cites work: Cores of convex games
cites work: Sequencing games with controllable processing times
cites work: On the balancedness of relaxed sequencing games
cites work: Minimum Concave Cost Flows in Certain Networks
DOI: 10.1016/J.MATHSOCSCI.2009.01.002
description: scientific article; zbMATH DE number 5642982