The nucleolus of arborescence games in directed acyclic graphs

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)89-92
Number of pages4
JournalOperations Research Letters
Volume43
Issue number1
DOIs
Publication statusPublished - Jan 2015

Fingerprint

Nucleolus
Directed Acyclic Graph
Game
Linear Time
Directed acyclic graph

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 journalArticle

@article{5249e44e5db4480498ead890326a08d1,
title = "The nucleolus of arborescence games in directed acyclic graphs",
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.",
author = "Naoyuki Kamiyama",
year = "2015",
month = "1",
doi = "10.1016/j.orl.2014.12.005",
language = "English",
volume = "43",
pages = "89--92",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "1",

}

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 -