TY - JOUR
T1 - The nucleolus of arborescence games in directed acyclic graphs
AU - Kamiyama, Naoyuki
N1 - Funding Information:
This work is supported by JSPS KAKENHI Grant number 25240004 . The author would like to thank anonymous referees for helpful comments on an earlier version of this paper.
PY - 2015/1
Y1 - 2015/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84920109962&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84920109962&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2014.12.005
DO - 10.1016/j.orl.2014.12.005
M3 - Article
AN - SCOPUS:84920109962
VL - 43
SP - 89
EP - 92
JO - Operations Research Letters
JF - Operations Research Letters
SN - 0167-6377
IS - 1
ER -