On cost allocation for a spanning tree: A game theoretic approach
From MaRDI portal
Publication:4133451
Cited in
(only showing first 100 items - show all)- Allocating costs in set covering problems
- Congestion network problems and related games
- The P-value for cost sharing in minimum
- NTU PERT games
- Network flow problems and permutationally concave games
- The folk rule for minimum cost spanning tree problems with multiple sources
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- A new approach to agglomeration problems
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- The minimum cost spanning forest game
- Hyperadditive games and applications to networks or matching problems
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- Cooperative networks games with elastic demands
- Stable cost sharing in production allocation games
- Connection problems in mountains and monotonic allocation schemes.
- A core-allocation for a network restricted linear production game
- Three-person spanning tree games
- Merge-proofness in minimum cost spanning tree problems
- An application of crypto cloud computing in social networks by cooperative game theory
- Communication and its cost in graph-restricted games
- Dynamic Shapley Value for Two-Stage Cost Sharing Game
- Stability and fairness in the job scheduling problem
- Minimum cost forest games
- 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 a minimal cost spanning tree: beyond the folk solution
- Sharing the cost of multicast transmissions in wireless networks
- An egalitarian solution to minimum cost spanning tree problems
- Cooperative games arising from network flow problems
- The truncated core for games with upper bounds
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation
- Social enterprise tree network games
- Cost sharing in networks: some open questions
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- On analyzing cost allocation problems: cooperation building structures and order problem representations
- Sequential contributions rules for minimum cost spanning tree problems
- On the core of network synthesis games
- Cost allocation in the Chinese postman problem
- Generalized minimum spanning tree games
- Averaged dual solution for linear production games and its characterization
- On the core of the minimum cost Steiner tree game in networks
- Trouble comes in threes: core stability in minimum cost connection networks
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- Supportability of network cost functions
- On approximately fair cost allocation in Euclidean TSP games
- Cost allocation in asymmetric trees
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- Traveling salesman games with the Monge property
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Proof of permutationally convexity of MCSF games
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
- Cost monotonicity, consistency and minimum cost spanning tree games
- Algorithms for real-time scheduling of jobs on mixed model assembly lines
- 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
- An overview on game theory applications to engineering
- Cost allocation protocols for supply contract design in network situations
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- Minimum cost spanning tree problems with groups
- Maximizing the minimum voter satisfaction on spanning trees
- Characterizing rules in minimum cost spanning tree problems
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Cost allocation in spanning network enterprises with stochastic connection costs.
- A characterization of the folk rule for multi-source minimal cost spanning tree problems
- On obligation rules for minimum cost spanning tree problems
- Decentralized pricing in minimum cost spanning trees
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Absence-proofness: group stability beyond the core
- On the complexity of testing membership in the core of min-cost spanning tree games
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A note on maximizing the minimum voter satisfaction on spanning trees
- A note on Steiner tree games
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- Extended cooperative networks games
- Noncooperative cost spanning tree games with budget restrictions
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- On Groves mechanisms for costly inclusion
- Operations research games: A survey. (With comments and rejoinder)
- Minimum cost spanning tree games and spillover stability
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Characterization of monotonic rules in minimum cost spanning tree problems
- Cooperative approach to a location problem with agglomeration economies
- Approximating the least core value and least core of cooperative games with supermodular costs
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- The irreducible Core of a minimum cost spanning tree game
- An efficient characterization of submodular spanning tree games
- A cooperative location game based on the 1-center location problem
- Multi-criteria minimum cost spanning tree games
- Cost sharing in production economies
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
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)