The nucleolus of arborescence games in directed acyclic graphs
From MaRDI portal
Publication:1785328
DOI10.1016/J.ORL.2014.12.005zbMATH Open1408.91046OpenAlexW2032230614MaRDI QIDQ1785328FDOQ1785328
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
Recommendations
Cites Work
- Game theoretic analysis of a bankruptcy problem from the Talmud
- The Nucleolus of a Characteristic Function Game
- An algorithm for finding the nucleolus of assignment games
- The kernel/nucleolus of a standard tree game
- A simple algorithm for the nucleolus of airport profit games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Introduction to the Theory of Cooperative Games
- The nucleolus of balanced simple flow networks
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Computing the nucleolus of weighted voting games
- Finding nucleolus of flow game
- Fair cost allocations under conflicts - a game-theoretic point of view -
- On the computational complexity of weighted voting games
- Matching Games: The Least Core and the Nucleolus
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Title not available (Why is that?)
Cited In (2)
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)
