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

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The nucleolus of arborescence games in directed acyclic graphs'. Together they form a unique fingerprint.

  • Cite this