On cost allocation for a spanning tree: A game theoretic approach
From MaRDI portal
Publication:4133451
DOI10.1002/net.3230060404zbMath0357.90083OpenAlexW1995443028WikidataQ126263635 ScholiaQ126263635MaRDI QIDQ4133451
Publication date: 1976
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230060404
Cooperative games (91A12) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items (only showing first 100 items - show all)
A core-allocation for a network restricted linear production game ⋮ Multi-criteria minimum cost spanning tree games ⋮ Set-valued TU-games ⋮ Consistency requirements and pattern methods in cost sharing problems with technological cooperation ⋮ Social enterprise tree network games ⋮ Generalized minimum spanning tree games ⋮ Cost allocation in asymmetric trees ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Fair cost-sharing methods for the minimum spanning tree game ⋮ On the core of the minimum cost Steiner tree game in networks ⋮ Absence-proofness: group stability beyond the core ⋮ Communication and its cost in graph-restricted games ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Minimum cost forest games ⋮ The kernel/nucleolus of a standard tree game ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ Allocating costs in set covering problems ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ 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 ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Minimum cost spanning tree games and spillover stability ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ Strategic cooperation in cost sharing games ⋮ The minimum cost spanning forest game ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ A cost allocation rule for \(k\)-hop minimum cost spanning tree problems ⋮ Minimum cost spanning tree games and population monotonic allocation schemes. ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ Monotonicity of solutions in certain dynamic cooperative games ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Cooperative games arising from network flow problems ⋮ Minimum cost arborescences ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Sharing the cost of maximum quality optimal spanning trees ⋮ Strategic sharing of a costly network ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Supportability of network cost functions ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ Hyperadditive games and applications to networks or matching problems ⋮ 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 ⋮ Knapsack cost sharing ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ The truncated core for games with upper bounds ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ The minimum cost shortest-path tree game ⋮ Connection problems in mountains and monotonic allocation schemes. ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ Facets of the cone of totally balanced games ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ Cost monotonicity, consistency and minimum cost spanning tree games ⋮ Pricing traffic in a spanning network ⋮ On obligation rules for minimum cost spanning tree problems ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ Sequential contributions rules for minimum cost spanning tree problems ⋮ Stability and fairness in the job scheduling problem ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ 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 note on maximizing the minimum voter satisfaction on spanning trees ⋮ Maximizing the minimum voter satisfaction on spanning trees ⋮ A characterization of the folk rule for multi-source minimal cost spanning tree problems ⋮ Cost allocation protocols for supply contract design in network situations ⋮ Total balancedness condition for Steiner tree games. ⋮ Cost allocation in spanning network enterprises with stochastic connection costs. ⋮ On the core of network synthesis games ⋮ Extended cooperative networks games ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ Stable cost sharing in production allocation games ⋮ Traveling salesman games with the Monge property ⋮ Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms ⋮ Stable cores in information graph games ⋮ Network flow problems and permutationally concave games ⋮ Opportune moment strategies for a cost spanning tree game ⋮ On the grey obligation rules ⋮ 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 ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Cost allocation in the Chinese postman problem ⋮ Three-person spanning tree games ⋮ A new approach to agglomeration problems ⋮ An axiomatic approach in minimum cost spanning tree problems with groups ⋮ Cooperative interval games: mountain situations with interval data ⋮ Algorithms for real-time scheduling of jobs on mixed model assembly lines ⋮ Optimal equilibria in the non-cooperative game associated with cost spanning tree problem ⋮ NTU PERT games
This page was built for publication: On cost allocation for a spanning tree: A game theoretic approach
