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)- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Monotonicity of solutions in certain dynamic cooperative games
- Opportune moment strategies for a cost spanning tree game
- Total balancedness condition for Steiner tree 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 generalization of obligation rules for minimum cost spanning tree problems
- A generalized linear production model: A unifying model
- Algorithmic solutions for maximizing shareable costs
- Sharing the cost of maximum quality optimal spanning trees
- Strategic sharing of a costly network
- A discrete cost sharing model with technological cooperation
- Knapsack cost sharing
- Approximately fair cost allocation in metric traveling salesman games
- Minimum cost spanning tree games
- Pricing traffic in a spanning network
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- Approximate stable solutions in infinite tree problems
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- On the core and nucleolus of minimum cost spanning tree games
- Minimum incoming cost rules for arborescences
- Cooperative interval games: mountain situations with interval data
- Fair allocation on a network
- ``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
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems
- Stable cores in information graph games
- The minimum cost shortest-path tree game
- Popular spanning trees
- On the set of extreme core allocations for minimal cost spanning tree problems
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
- Stable source connection and assignment problems as multi-period shortest path problems
- Tarification par des jeux Coopératifs avec Demandes Élastiques
- On the grey obligation rules
- Spanning-tree games
- Minimum cost spanning tree problems with indifferent agents
- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
- The optimistic TU game in minimum cost spanning tree problems
- Cost-allocation problems for fuzzy agents in a fixed-tree network
- 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
- 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
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)