A fair rule in minimum cost spanning tree problems
From MaRDI portal
Publication:2469848
DOI10.1016/j.jet.2006.11.001zbMath1132.91366OpenAlexW2009698535MaRDI QIDQ2469848
Gustavo Bergantiños, Juan J. Vidal-Puga
Publication date: 11 February 2008
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jet.2006.11.001
Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Sharing sequential values in a network ⋮ Cost allocation in asymmetric trees ⋮ A discrete cost sharing model with technological cooperation ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Fair cost-sharing methods for the minimum spanning tree game ⋮ Absence-proofness: group stability beyond the core ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ Allocating costs in set covering problems ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ Algorithms for computing the folk rule in minimum cost spanning tree problems with groups ⋮ Stable and weakly additive cost sharing in shortest path problems ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Broadcasting revenue sharing after cancelling sports competitions ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ Allocating extra revenues from broadcasting sports leagues ⋮ A cost allocation rule for \(k\)-hop minimum cost spanning tree problems ⋮ The price of imperfect competition for a spanning network ⋮ Minimum cost spanning tree problems with indifferent agents ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Weakly monotonic solutions for cooperative games ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ Minimum cost arborescences ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Sharing the cost of maximum quality optimal spanning trees ⋮ Strategic sharing of a costly network ⋮ A VALUE FOR PERT PROBLEMS ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Monotonicity in sharing the revenues from broadcasting sports leagues ⋮ Hyperadditive games and applications to networks or matching problems ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ Loss allocation in energy transmission networks ⋮ \textit{Folk} solution for simple minimum cost spanning tree problems ⋮ On the core and nucleolus of directed acyclic graph games ⋮ Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ Pricing traffic in a spanning network ⋮ On obligation rules for minimum cost spanning tree problems ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ Sequential contributions rules for minimum cost spanning tree problems ⋮ Stability and fairness in the job scheduling problem ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ The folk solution and Boruvka's algorithm in minimum cost spanning tree problems ⋮ Emerging markets in the global economic network: real(ly) decoupling? ⋮ Additivity in minimum cost spanning tree problems ⋮ A new rule for source connection problems ⋮ Stable cost sharing in production allocation games ⋮ Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms ⋮ A cost sharing example in which subsidies are necessary for stability ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Revenue Sharing in Airline Alliance Networks ⋮ An axiomatic approach in minimum cost spanning tree problems with groups
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Axiomatization of the Shapley value on minimum cost spanning tree games
- A non-cooperative approach to the cost spanning tree problem.
- Cost monotonicity, consistency and minimum cost spanning tree games
- Monotonic solutions of cooperative games
- Spanning network games.
- The \(P\)-value for cost sharing in minimum
- The irreducible Core of a minimum cost spanning tree game
- On the core and nucleolus of minimum cost spanning tree games
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
This page was built for publication: A fair rule in minimum cost spanning tree problems