Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
From MaRDI portal
Publication:5459999
DOI10.1007/978-3-540-79309-0_31zbMath1136.90381OpenAlexW1861789228MaRDI QIDQ5459999
Yvonne Bleischwitz, Florian Schoppmann
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_31
Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Beyond Moulin mechanisms ⋮ Is Shapley cost sharing optimal? ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Cost sharing over combinatorial domains : Complement-free cost functions and beyond ⋮ An approximation algorithm for the stochastic fault-tolerant facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Survivable networks, linear programming relaxations and the parsimonious property
- Beyond Moulin mechanisms
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Incremental cost sharing: Characterization by coalition strategy-proofness
- New trade-offs in cost-sharing mechanisms
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Applications of approximation algorithms to cooperative games
- Optimal Efficiency Guarantees for Network Design Mechanisms
- Strategyproof sharing of submodular costs: budget balance versus efficiency
This page was built for publication: Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location