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.
| Original language | English |
|---|---|
| Pages (from-to) | 89-92 |
| Number of pages | 4 |
| Journal | Operations Research Letters |
| Volume | 43 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2015 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics
Cite this
The nucleolus of arborescence games in directed acyclic graphs. / Kamiyama, Naoyuki.
In: Operations Research Letters, Vol. 43, No. 1, 01.2015, p. 89-92.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - The nucleolus of arborescence games in directed acyclic graphs
AU - Kamiyama, Naoyuki
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 -