Cooperative games arising from network flow problems

DOI10.1016/0377-2217(91)90315-MzbMath0745.90088OpenAlexW2023481827MaRDI QIDQ1178645

Edward C. Rosenthal

Publication date: 26 June 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90315-m

zbMATH Keywords

networkefficient algorithmsprofit sharingnonempty coresfair cost allocationno sidepayments

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic network models in operations research (90B10)

Related Items (1)

A review on cost allocation methods in collaborative transportation

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum cost spanning forest game
• The assignment game. I: The core
• Totally balanced games arising from controlled programming problems
• Minimum cost spanning tree games
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• On the core of linear production games
• On cost allocation for a spanning tree: A game theoretic approach
• Activity selection games and the minimum‐cut problem
• The Core of an N Person Game

This page was built for publication: Cooperative games arising from network flow problems