Very simple methods for all pairs network flow analysis
SIAM Journal on Computing
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Combinatorial optimization games
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
| Hi-index | 0.00 |
In this paper we introduce a cooperative game based on the minimum cut tree problem which is also known as multi-terminal maximum flow problem. In a routing situation a network with capacities induced by vertices of a coalition has to be substituted by a network providing the same capacity for non-simultaneous flows but having a minimum number of edges and minimum total capacity. The solutions to this requirement are exactly the minimum cut trees. Minimum cut tree games are shown to be totally balanced and a solution in their core can be obtained in polynomial time. This special core allocation is closely related to the solution of the original graph theoretical problem. We give an example showing that the game is not supermodular in general, however, it is for special cases and for some of those we give an explicit formula for the calculation of the Shapley value.