COST SHARING IN NETWORKS: SOME OPEN QUESTIONS
From MaRDI portal
Publication:2854000
DOI10.1142/S021919891340001XzbMath1274.91051OpenAlexW2154945308MaRDI QIDQ2854000
Publication date: 17 October 2013
Published in: International Game Theory Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021919891340001x
Programming involving graphs or networks (90C35) Cooperative games (91A12) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (9)
Endowment additivity and the weighted proportional rules for adjudicating conflicting claims ⋮ Axiomatization of the counting rule for cost-sharing with possibly redundant items ⋮ Routing-proofness in congestion-prone networks ⋮ Sharing the cost of redundant items ⋮ Knapsack cost sharing ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ Stable cost sharing in production allocation games ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ Revenue Sharing in Airline Alliance Networks
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Equal-need sharing of a network under connectivity constraints
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- On the core of network synthesis games
- Sharing a minimal cost spanning tree: beyond the folk solution
- Additivity in minimum cost spanning tree problems
- On the core of a traveling salesman cost allocation game
- Sharing the cost of a network: core and core allocations
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Egalitarianism under earmark constraints
- 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
- Cores of convex games
- On cost allocation in communication networks
- The irreducible Core of a minimum cost spanning tree game
- Sharing the Cost of a Capacity Network
- On the core and nucleolus of minimum cost spanning tree games
- A generalized linear production model: A unifying model
- Minimum cost spanning tree games
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- A Simple Expression for the Shapley Value in a Special Case
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Balancing supply and demand under bilateral constraints
- Cooperative facility location games
This page was built for publication: COST SHARING IN NETWORKS: SOME OPEN QUESTIONS
