Investigation on irreducible cost vectors in minimum cost arborescence problems
From MaRDI portal
Publication:1753571
DOI10.1016/J.EJOR.2017.01.041zbMath1403.91214OpenAlexW2580546709MaRDI QIDQ1753571
Tetsuzo Tanino, Yoshifumi Kusunoki
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.041
Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Minimum cost arborescences
- Characterization of monotonic rules in minimum cost spanning tree problems
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- On obligation rules for minimum cost spanning tree problems
- Sharing a minimal cost spanning tree: beyond the folk solution
- Robustness of minimum cost arborescences
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- The optimistic \(TU\) game in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- Equivalent Representations of Set Functions
- CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
- Optimum branchings
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Investigation on irreducible cost vectors in minimum cost arborescence problems