Truthful two-facility location with candidate locations
From MaRDI portal
Publication:6546305
DOI10.1007/978-3-031-43254-5_21zbMATH Open1542.90146MaRDI QIDQ6546305
[[Person:6156614|Author name not available (Why is that?)]], Alexandros A. Voudouris, Panagiotis Kanellopoulos
Publication date: 29 May 2024
Could not fetch data.
Cites Work
- Heterogeneous facility location without money
- Strategyproof facility location for concave cost functions
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategyproof facility location for three agents on a circle
- Approximate mechanism design for distributed facility location
- Mechanism design for facility location games with candidate locations
- Mechanism design for facility location with fractional preferences and minimum distance
- Constrained heterogeneous facility location games with max-variant cost
- Strategyproof Approximation of the Minimax on Networks
- Two-facility Location Games with Minimum Distance Requirement
- Heterogeneous facility location with limited resources
- Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions
- On Discrete Truthful Heterogeneous Two-Facility Location
- Obnoxious facility location games with candidate locations
This page was built for publication: Truthful two-facility location with candidate locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546305)
