Cost monotonicity, consistency and minimum cost spanning tree games
From MaRDI portal
Publication:705853
DOI10.1016/J.GEB.2003.09.008zbMATH Open1117.91308OpenAlexW2103267790MaRDI QIDQ705853FDOQ705853
Authors: Bhaskar Dutta, Anirban Kar
Publication date: 16 February 2005
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://ageconsearch.umn.edu/record/269403
Recommendations
- scientific article; zbMATH DE number 5666824
- Moving average rule for minimum cost spanning tree games
- Characterization of monotonic rules in minimum cost spanning tree problems
- The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
- A fair rule in minimum cost spanning tree problems
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Potential, Value, and Consistency
- Consistency and its converse: an introduction
- Minimum cost spanning tree games
- On the reduced game property and its converse
- The kernel of a cooperative game
- On the core and nucleolus of minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Spanning network games.
- On the History of the Minimum Spanning Tree Problem
- The Conditional Auction Mechanism for Sharing a Surplus
- Title not available (Why is that?)
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Supportability of network cost functions
Cited In (66)
- The folk rule for minimum cost spanning tree problems with multiple sources
- Stable and weakly additive cost sharing in shortest path problems
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- Cost allocation and airport problems
- Submodularity of minimum-cost spanning tree games
- Moving average rule for minimum cost spanning tree games
- The \(P\)-value for cost sharing in minimum
- Network flow problems and permutationally concave games
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
- Merge-proofness in minimum cost spanning tree problems
- Sharing sequential values in a network
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
- Sharing a minimal cost spanning tree: beyond the folk solution
- Cost sharing in networks: some open questions
- Social enterprise tree network games
- Additivity in minimum cost spanning tree problems
- Sequential contributions rules for minimum cost spanning tree problems
- Generalized minimum spanning tree games
- Cost allocation in asymmetric trees
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
- Minimum cost arborescences
- On the core of cost-revenue games: minimum cost spanning tree games with revenues
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- Minimum-cost spanning tree games: Bird rule revisited
- Cost allocation protocols for supply contract design in network situations
- Minimum cost spanning tree problems with groups
- A characterization of the folk rule for multi-source minimal cost spanning tree problems
- Maximizing the minimum voter satisfaction on spanning trees
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- On obligation rules for minimum cost spanning tree problems
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Decentralized pricing in minimum cost spanning trees
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- Absence-proofness: group stability beyond the core
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A note on maximizing the minimum voter satisfaction on spanning trees
- Title not available (Why is that?)
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- Bird's tree allocations revisited
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Finding socially best spanning treesî
- Characterization of monotonic rules in minimum cost spanning tree problems
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Multi-criteria minimum cost spanning tree games
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Title not available (Why is that?)
- An axiomatic approach in minimum cost spanning tree problems with groups
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- A generalization of obligation rules for minimum cost spanning tree problems
- Knapsack cost sharing
- Strategic sharing of a costly network
- Pricing traffic in a spanning network
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- A new rule for source connection problems
- Popular spanning trees
- Consistency and its converse: an introduction
- On the set of extreme core allocations for minimal cost spanning tree problems
- Spanning-tree games
- The optimistic \(TU\) game in minimum cost spanning tree problems
- Cost-allocation problems for fuzzy agents in a fixed-tree network
- Minimum cost spanning tree problems as value sharing problems
This page was built for publication: Cost monotonicity, consistency and minimum cost spanning tree games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705853)