On cost allocation for a spanning tree: A game theoretic approach

Cited In (only showing first 100 items - show all)

Congestion network problems and related games
The \(P\)-value for cost sharing in minimum
NTU PERT games
Network flow problems and permutationally concave games
A characterization of kruskal sharing rules for minimum cost spanning tree problems
The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
The minimum cost spanning forest game
Stable cost sharing in production allocation games
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
A core-allocation for a network restricted linear production game
Merge-proofness in minimum cost spanning tree problems
Minimum cost forest games
Sharing a minimal cost spanning tree: beyond the folk solution
Cooperative games arising from network flow problems
The truncated core for games with upper bounds
Cost sharing in networks: some open questions
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
On the core of network synthesis games
Cost allocation in the Chinese postman problem
Generalized minimum spanning tree games
On approximately fair cost allocation in Euclidean TSP games
Cost allocation in asymmetric trees
Traveling salesman games with the Monge property
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
Cost monotonicity, consistency and minimum cost spanning tree games
The kernel/nucleolus of a standard tree game
Minimum cost arborescences
Axiomatization of the Shapley value on minimum cost spanning tree games
A non-cooperative game theory approach to cost sharing in networks
Set-valued TU-games
Connection situations under uncertainty and cost monotonic solutions
Minimum cost spanning tree problems with groups
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
On the complexity of testing membership in the core of min-cost spanning tree games
Absence-proofness: group stability beyond the core
A note on Steiner tree games
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
A note on maximizing the minimum voter satisfaction on spanning trees
Operations research games: A survey. (With comments and rejoinder)
Cooperative approach to a location problem with agglomeration economies
The irreducible Core of a minimum cost spanning tree game
Characterization of monotonic rules in minimum cost spanning tree problems
A cooperative location game based on the 1-center location problem
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
Truth-telling and Nash equilibria in minimum cost spanning tree models
Monotonicity of solutions in certain dynamic cooperative games
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 generalized linear production model: A unifying model
A generalization of obligation rules for minimum cost spanning tree problems
Minimum cost spanning tree games
Sharing the cost of maximum quality optimal spanning trees
A discrete cost sharing model with technological cooperation
On the core and nucleolus of minimum cost spanning tree games
Strategic sharing of a costly network
Fair allocation on a 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
On the set of extreme core allocations for minimal cost spanning tree problems
The minimum cost shortest-path tree game
Tarification par des jeux Coopératifs avec Demandes Élastiques
Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
Spanning-tree games
Minimum cost spanning tree problems with indifferent agents
The optimistic \(TU\) game in minimum cost spanning tree problems
Facets of the cone of totally balanced games
Minimum cost spanning tree problems as value sharing problems
Strategic cooperation in cost sharing games
Sharing the proceeds from a hierarchical venture
On the core and nucleolus of directed acyclic graph games
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
The folk rule for minimum cost spanning tree problems with multiple sources
Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
A new approach to agglomeration problems
Hyperadditive games and applications to networks or matching problems
Cooperative networks games with elastic demands
Connection problems in mountains and monotonic allocation schemes.
Three-person spanning tree games
Dynamic Shapley Value for Two-Stage Cost Sharing Game
An application of crypto cloud computing in social networks by cooperative game theory
Stability and fairness in the job scheduling problem
Communication and its cost in graph-restricted games
An egalitarian solution to minimum cost spanning tree problems
A cost sharing example in which subsidies are necessary for stability
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
Sharing the cost of multicast transmissions in wireless networks
Efficient black-box reductions for separable cost sharing
Efficient black-box reductions for separable cost sharing

This page was built for publication: On cost allocation for a spanning tree: A game theoretic approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133451)