Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
From MaRDI portal
Publication:5459999
DOI10.1007/978-3-540-79309-0_31zbMATH Open1136.90381OpenAlexW1861789228MaRDI QIDQ5459999FDOQ5459999
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
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Discrete location and assignment (90B80)
Cites Work
- Applications of approximation algorithms to cooperative games
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- Beyond Moulin mechanisms
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Title not available (Why is that?)
- A group-strategyproof mechanism for Steiner forests
- Optimal Efficiency Guarantees for Network Design Mechanisms
- Survivable networks, linear programming relaxations and the parsimonious property
- Limitations of cross-monotonic cost sharing schemes
- New trade-offs in cost-sharing mechanisms
Cited In (5)
Recommendations
- A complete characterization of group-strategyproof mechanisms of cost-sharing π π
- A complete characterization of group-strategyproof mechanisms of cost-sharing π π
- Approximation and Online Algorithms π π
- Limitations of cross-monotonic cost-sharing schemes π π
- Limitations of cross-monotonic cost sharing schemes π π
This page was built for publication: Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459999)