On the core and nucleolus of directed acyclic graph games
From MaRDI portal
Publication:526836
DOI10.1007/s10107-016-1062-yzbMath1366.91038OpenAlexW2509923016MaRDI QIDQ526836
Tamás Solymosi, Tamás Fleiner, Balázs R. Sziklai
Publication date: 15 May 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/39797/1/DAG_MP_rev2.pdf
Trees (05C05) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (5)
On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ On the core and nucleolus of directed acyclic graph games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ A heuristic procedure for computing the nucleolus
Cites Work
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- On the core and nucleolus of directed acyclic graph games
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- The minimum cost spanning forest game
- Sharing a minimal cost spanning tree: beyond the folk solution
- The Steiner tree problem
- The \({\mathcal B}\)-nucleolus of TU-games
- Airport problems and consistent allocation rules.
- On the complexity of testing membership in the core of min-cost spanning tree games
- Minimum cost forest games
- Characterization sets for the nucleolus in balanced games
- Weighted allocation rules for standard fixed tree games
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- Spanning network games.
- Monotonic games are spanning network games
- A fair rule in minimum cost spanning tree problems
- A note on Steiner tree games
- On the core and nucleolus of minimum cost spanning tree games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Minimum cost spanning tree games
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- On cost allocation for a spanning tree: A game theoretic approach
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The Nucleolus of a Characteristic Function Game
- Finding nucleolus of flow game
This page was built for publication: On the core and nucleolus of directed acyclic graph games
