Minimum cost spanning tree problems with groups
From MaRDI portal
Publication:964464
DOI10.1007/s00199-009-0444-2zbMath1229.91038MaRDI QIDQ964464
Gustavo Bergantiños, María Gómez-Rúa
Publication date: 15 April 2010
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-009-0444-2
91A12: Cooperative games
91A43: Games involving graphs
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Fair waste pricing: an axiomatic analysis to the NIMBY problem, CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Axiomatization of the Shapley value on minimum cost spanning tree games
- A non-cooperative approach to the cost spanning tree problem.
- Cost monotonicity, consistency and minimum cost spanning tree games
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
- The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Additivity in minimum cost spanning tree problems
- Implementing cooperative solution concepts: a generalized bidding approach
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Component efficient solutions in line-graph games with applications
- ``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
- The irreducible Core of a minimum cost spanning tree game
- Noncooperative cost spanning tree games with budget restrictions
- On cost allocation for a spanning tree: A game theoretic approach
