Network flow problems and permutationally concave games
From MaRDI portal
Publication:1042338
DOI10.1016/j.mathsocsci.2009.01.002zbMath1176.91009OpenAlexW1973794372MaRDI QIDQ1042338
Publication date: 7 December 2009
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2009.01.002
Related Items (4)
A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Minimum cost spanning tree problems with indifferent agents ⋮ Stable cost sharing in production allocation games ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Cost monotonicity, consistency and minimum cost spanning tree games
- Sequencing games with controllable processing times
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- On the balancedness of relaxed sequencing games
- Congestion network problems and related games
- Cores of convex games
- On the core and nucleolus of minimum cost spanning tree games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- On cost allocation for a spanning tree: A game theoretic approach
- Proof of permutationally convexity of MCSF games
- Minimum Concave Cost Flows in Certain Networks
This page was built for publication: Network flow problems and permutationally concave games
