Minimum cost spanning tree games
From MaRDI portal
Cites work
- A simple expression for the nucleolus in a special case
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cost allocation for a spanning tree
- Cost allocation for steiner trees
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- On cost allocation for a spanning tree: A game theoretic approach
Cited in
(only showing first 100 items - show all)- Opportune moment strategies for a cost spanning tree game
- Communication and its cost in graph-restricted games
- On the core of a traveling salesman cost allocation game
- Cooperative games arising from network flow problems
- Traveling salesman games
- Supportability of network cost functions
- On the concavity of delivery games
- Cost allocation in the Chinese postman problem
- On a cost allocation problem arising from a capacitated concentrator covering problem
- Operations research games: A survey. (With comments and rejoinder)
- On the core of routing games
- On the complexity of testing membership in the core of min-cost spanning tree games
- Minimum cost forest games
- Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof
- On approximately fair cost allocation in Euclidean TSP games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Three-person spanning tree games
- Social enterprise tree network games
- Values for cooperative games over graphs and games with inadmissible coalitions
- On the submodularity of multi-depot traveling salesman games
- The minimum cost shortest-path tree game
- Compromise values in cooperative game theory
- Total balancedness condition for Steiner tree games.
- Cost allocation in spanning network enterprises with stochastic connection costs.
- Traveling salesman games with the Monge property
- Multi-criteria minimum cost spanning tree games
- A cost allocation problem arising in hub-spoke network systems
- On the core of the minimum cost Steiner tree game in networks
- The kernel/nucleolus of a standard tree game
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- Strategic cooperation in cost sharing games
- Stable cores in information graph games
- A new approach to agglomeration problems
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- Computing Shapley values in the plane
- Efficient computation of the Shapley value for large-scale linear production games
- Trouble comes in threes: core stability in minimum cost connection networks
- On the core of cost-revenue games: minimum cost spanning tree games with revenues
- A generalization of obligation rules for minimum cost spanning tree problems
- A cooperative location game based on the 1-center location problem
- Cooperative interval games: mountain situations with interval data
- On the core of information graph games
- Monotonic games are spanning network games
- On the set of extreme core allocations for minimal cost spanning tree problems
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- Approximating the least core value and least core of cooperative games with supermodular costs
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- The optimistic TU game in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The P-value for cost sharing in minimum
- Congestion network problems and related games
- A new rule for source connection problems
- On games arising from multi-depot Chinese postman problems
- A survey on networking games in telecommunications
- New techniques for cost sharing in combinatorial optimization games
- Monotonicity of the core and value in dynamic cooperative games
- Highway games on weakly cyclic graphs
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- A core-allocation for a network restricted linear production game
- Open problems in cooperative location games
- Cost sharing in networks: some open questions
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Generalized minimum spanning tree games
- A note on Steiner tree games
- Computing near-optimal stable cost allocations for cooperative games by Lagrangian relaxation
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- Approximate stable solutions in infinite tree problems
- Cooperation in one machine scheduling
- The irreducible Core of a minimum cost spanning tree game
- Minimal subsidies in expense sharing games
- Stochastic linear programming games with concave preferences
- On the core and nucleolus of minimum cost spanning tree games
- Proof systems and transformation games
- Pareto optimality in the kidney exchange Problem
- A generalized linear production model: A unifying model
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- Assignment markets that are uniquely determined by their core
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Proof of permutationally convexity of MCSF games
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Spanning-tree games
- Strategic sharing of a costly network
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Dynamic linear programming games with risk-averse players
- On the core and nucleolus of directed acyclic graph games
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- Merge-proofness in minimum cost spanning tree problems
- An efficient characterization of submodular spanning tree games
- Comments on: cooperative games and cost allocation problems
- Approximate core allocations for edge cover games
- Averaged dual solution for linear production games and its characterization
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems
- Tail risk in production networks
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- Minimum spanning trees in infinite graphs: theory and algorithms
- Algorithmic solutions for maximizing shareable costs
- Fair tree connection games with topology-dependent edge cost
- Lipschitz continuous allocations for optimization games
This page was built for publication: Minimum cost spanning tree games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3911709)
