The nucleolus of arborescence games in directed acyclic graphs

DOI10.1016/J.ORL.2014.12.005MaRDI QIDQ1785328zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the core and nucleolus of directed acyclic graph games
• The nucleolus of balanced simple flow networks
• The kernel/nucleolus of a standard tree game
• Computing the nucleolus of some combinatorially-structured games.
• Finding nucleolus of flow game

Cites work

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

Cited in

(2)

• A heuristic procedure for computing the nucleolus
• On the core and nucleolus of directed acyclic graph games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785328)