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.
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics