Article ID Journal Published Year Pages File Type
1142302 Operations Research Letters 2015 4 Pages PDF
Abstract

In this paper, we consider the problem of finding the nucleolus of arborescence games. We prove that the nucleolus of arborescence games in directed acyclic graphs can be found in linear time.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The nucleolus of arborescence games in directed acyclic graphs
Authors
,