On obligation rules for minimum cost spanning tree problems
From MaRDI portal
Recommendations
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- A generalization of obligation rules for minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- Characterization of monotonic rules in minimum cost spanning tree problems
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
Cites work
- scientific article; zbMATH DE number 4162686 (Why is no real title available?)
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- Additivity in minimum cost spanning tree problems
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- On cost allocation for a spanning tree: A game theoretic approach
- On the core and nucleolus of minimum cost spanning tree games
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Sharing a minimal cost spanning tree: beyond the folk solution
- The P-value for cost sharing in minimum
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- The optimistic TU game in minimum cost spanning tree problems
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
Cited in
(25)- The folk rule for minimum cost spanning tree problems with multiple sources
- Linking the Kar and folk solutions through a problem separation property
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
- An egalitarian solution to minimum cost spanning tree problems
- One-way and two-way cost allocation in hub network problems
- Sequential contributions rules for minimum cost spanning tree problems
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- Investigation on irreducible cost vectors in minimum cost arborescence problems
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- Minimum cost arborescences
- Connection situations under uncertainty and cost monotonic solutions
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Interval obligation rules and related results
- Characterization of monotonic rules in minimum cost spanning tree problems
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- A generalization of obligation rules for minimum cost spanning tree problems
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- Minimum incoming cost rules for arborescences
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- On the grey obligation rules
This page was built for publication: On obligation rules for minimum cost spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980946)