The nucleolus of arborescence games in directed acyclic graphs

DOI10.1016/j.orl.2014.12.005zbMath1408.91046OpenAlexW2032230614MaRDI QIDQ1785328

Naoyuki Kamiyama

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.12.005

zbMATH Keywords

directed acyclic graphnucleolusarborescence game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items (1)

A heuristic procedure for computing the nucleolus

Cites Work

• Unnamed Item
• Unnamed Item
• The nucleolus of balanced simple flow networks
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Game theoretic analysis of a bankruptcy problem from the Talmud
• An algorithm for finding the nucleolus of assignment games
• The kernel/nucleolus of a standard tree game
• Characterization sets for the nucleolus
• Computing the nucleolus of min-cost spanning tree games is NP-hard.
• On the computational complexity of weighted voting games
• A simple algorithm for the nucleolus of airport profit games
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• The Nucleolus of a Characteristic Function Game
• Matching Games: The Least Core and the Nucleolus
• Introduction to the Theory of Cooperative Games
• Finding nucleolus of flow game

This page was built for publication: The nucleolus of arborescence games in directed acyclic graphs