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)- Cost allocation protocols for supply contract design in network situations
- Extended cooperative networks games
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Network flow problems and permutationally concave games
- Opportune moment strategies for a cost spanning tree game
- Communication and its cost in graph-restricted games
- Monotonicity of solutions in certain dynamic cooperative games
- Cooperative games arising from network flow problems
- Supportability of network cost functions
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- Cost allocation in the Chinese postman problem
- Algorithms for real-time scheduling of jobs on mixed model assembly lines
- Operations research games: A survey. (With comments and rejoinder)
- On the complexity of testing membership in the core of min-cost spanning tree games
- Minimum cost forest games
- On approximately fair cost allocation in Euclidean TSP games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Three-person spanning tree games
- NTU PERT games
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation
- Social enterprise tree network games
- Minimum incoming cost rules for arborescences
- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
- Characterizing rules in minimum cost spanning tree problems
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- The minimum cost shortest-path tree game
- 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
- Set-valued TU-games
- 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
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Minimum cost spanning tree games and spillover stability
- Strategic cooperation in cost sharing games
- Sharing the cost of maximum quality optimal spanning trees
- Hyperadditive games and applications to networks or matching problems
- Facets of the cone of totally balanced games
- Pricing traffic in a spanning network
- A non-cooperative game theory approach to cost sharing in networks
- Stable cores in information graph games
- On the grey obligation rules
- Cost-allocation problems for fuzzy agents in a fixed-tree network
- A new approach to agglomeration problems
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- Allocating costs in set covering problems
- An application of crypto cloud computing in social networks by cooperative game theory
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Trouble comes in threes: core stability in minimum cost connection networks
- Knapsack cost sharing
- Stability and fairness in the job scheduling problem
- A generalization of obligation rules for minimum cost spanning tree problems
- A cooperative location game based on the 1-center location problem
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A characterization of the folk rule for multi-source minimal cost spanning tree problems
- Stable cost sharing in production allocation games
- A cost sharing example in which subsidies are necessary for stability
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- An axiomatic approach in minimum cost spanning tree problems with groups
- Cooperative interval games: mountain situations with interval data
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- A discrete cost sharing model with technological cooperation
- 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
- Minimum cost spanning tree problems with indifferent agents
- 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
- Cooperative approach to a location problem with agglomeration economies
- Minimum cost spanning tree problems as value sharing problems
- A core-allocation for a network restricted linear production game
- An overview on game theory applications to engineering
- 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
- Cost allocation in asymmetric trees
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- Approximate stable solutions in infinite tree problems
- The irreducible Core of a minimum cost spanning tree game
- Absence-proofness: group stability beyond the core
- On the core and nucleolus of minimum cost spanning tree games
- Cooperative networks games with elastic demands
- Noncooperative cost spanning tree games with budget restrictions
- A generalized linear production model: A unifying model
- Minimum cost spanning tree games
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Fair allocation on a network
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Proof of permutationally convexity of MCSF games
- A cost allocation rule for k-hop minimum cost spanning tree problems
- Tarification par des jeux Coopératifs avec Demandes Élastiques
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)