On the set of extreme core allocations for minimal cost spanning tree problems
From MaRDI portal
Publication:2397642
Recommendations
- The constrained minimum spanning tree problem
- scientific article; zbMATH DE number 447202
- On the approximability of some maximum spanning tree problems
- On the approximability of some Maximum Spanning Tree Problems
- A cost allocation rule for k-hop minimum cost spanning tree problems
- Efficient algorithms for a constrained k-tree core problem in a tree network
- Approximating minimum-cost graph problems with spanning tree edges
- On the simultaneous minimum spanning trees problem
- Exact Algorithms for the Minimum Load Spanning Tree Problem
- Maximizing spanning trees in almost complete graphs
Cites work
- A cost allocation rule for k-hop minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- A simple selling and buying procedure
- An average lexicographic value for cooperative games
- Assignment games satisfy the CoMa-property
- Bargaining with commitments
- Characterization of the extreme core allocations of the assignment game.
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Clan games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Cost sharing with multiple technologies
- Extensive coverings and exact core bounds
- scientific article; zbMATH DE number 41329 (Why is no real title available?)
- Minimum cost spanning tree games
- Non-cooperative and axiomatic characterizations of the average lexicographic value
- On cost allocation for a spanning tree: A game theoretic approach
- On extreme points of the core and reduced games
- On the core and nucleolus of minimum cost spanning tree games
- On the core of information graph games
- On the core of the minimum cost Steiner tree game in networks
- Sharing a minimal cost spanning tree: beyond the folk solution
- Stable lexicographic rules for shortest path games
- Steiner tree problems
- Strongly essential coalitions and the nucleolus of peer group games
- The kernel of a cooperative game
Cited in
(18)- On a class of vertices of the core
- Multi-criteria minimum cost spanning tree games
- Sharing the cost of maximum quality optimal spanning trees
- Hyperadditive games and applications to networks or matching problems
- A non-cooperative game theory approach to cost sharing in networks
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- One-way and two-way cost allocation in hub network problems
- A cost sharing example in which subsidies are necessary for stability
- Minimum cost spanning tree problems with indifferent agents
- Minimum cost spanning tree problems as value sharing problems
- Comments on: ``Remarkable polyhedra related to set functions, games and capacities
- Approximate stable solutions in infinite tree problems
- The irreducible Core of a minimum cost spanning tree game
- scientific article; zbMATH DE number 447202 (Why is no real title available?)
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- An egalitarian solution to minimum cost spanning tree problems
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- Comparative statics of minimum-cost-spanning-tree games
This page was built for publication: On the set of extreme core allocations for minimal cost spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397642)
