The nucleolus of arborescence games in directed acyclic graphs
type: Item
instance of: scholarly article
title: The nucleolus of arborescence games in directed acyclic graphs
zbMATH Open document ID: 1408.91046
author: Naoyuki Kamiyama
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 6945337
zbMATH Keywords: arborescence game
zbMATH Keywords: nucleolus
zbMATH Keywords: directed acyclic graph
MaRDI profile type: Publication
full work available at URL: j.orl.2014.12.005
OpenAlex ID: W2032230614
cites work: Game theoretic analysis of a bankruptcy problem from the Talmud
cites work: A simple algorithm for the nucleolus of airport profit games
cites work: Finding nucleolus of flow game
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: On the computational complexity of weighted voting games
cites work: Q4633840
cites work: Computing the nucleolus of min-cost spanning tree games is NP-hard.
cites work: Characterization sets for the nucleolus
cites work: The kernel/nucleolus of a standard tree game
cites work: Q3916403
cites work: Matching Games: The Least Core and the Nucleolus
cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
cites work: Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
cites work: Fair cost allocations under conflicts - a game-theoretic point of view -
cites work: Introduction to the Theory of Cooperative Games
cites work: The nucleolus of balanced simple flow networks
cites work: The Nucleolus of a Characteristic Function Game
cites work: An algorithm for finding the nucleolus of assignment games
DOI: 10.1016/J.ORL.2014.12.005
description: scientific article; zbMATH DE number 6945337