Decentralized pricing in minimum cost spanning trees
From MaRDI portal
Publication:612004
DOI10.1007/S00199-009-0485-6zbMath1202.91040OpenAlexW2162366306MaRDI QIDQ612004
Lars Peter Østerdal, Hervé Moulin, Jens Leth Hougaard
Publication date: 3 January 2011
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://curis.ku.dk/ws/files/32298263/decentralized_pricing.pdf
Related Items (8)
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Sharing sequential values in a network ⋮ Sharing the cost of risky projects ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ On guarantees, vetoes, and random dictators ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Free intermediation in resource transmission ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Cost monotonicity, consistency and minimum cost spanning tree games
- Sharing a minimal cost spanning tree: beyond the folk solution
- Equitable distribution of indivisible objects
- Welfare bounds in the cooperative production problem
- Minimum cost spanning tree games and population monotonic allocation schemes.
- 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
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Group Decision Devices
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- A new solution to the random assignment problem.
This page was built for publication: Decentralized pricing in minimum cost spanning trees
