Constant-approximate and constant-strategyproof two-facility location
From MaRDI portal
Cites work
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
- Agent-constrained truthful facility location games
- Approximation Algorithms for Metric Facility Location Problems
- Condorcet-consistent and approximately strategyproof tournament rules
- Facility reallocation on the line
- Generalized median voter schemes and committees
- How Profitable Are Strategic Behaviors in a Market?
- scientific article; zbMATH DE number 7650351 (Why is no real title available?)
- Mechanisms for obnoxious facility game on a path
- Nonmanipulability in two dimensions
- Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions
- Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game
- Pareto optimality, anonymity, and strategy-proofness in location problems
- Probabilistic analysis of facility location on random shortest path metrics
- Proportionally fair clustering revisited
- Reallocating multiple facilities on the line
- Stable matching mechanisms are not obviously strategy-proof
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategy-proof location on a network
- Strategy-proof mechanisms for facility location games with many facilities
- Strategyproof approximation of the minimax on networks
- The k-facility location problem via optimal transport: a Bayesian study of the percentile mechanisms
- Truthful two-facility location with candidate locations
This page was built for publication: Constant-approximate and constant-strategyproof two-facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851613)
