Truthful two-facility location with candidate locations
From MaRDI portal
Publication:6652456
DOI10.1016/J.TCS.2024.114913MaRDI QIDQ6652456
Panagiotis Kanellopoulos, Author name not available (Why is that?), Alexandros A. Voudouris
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
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
- Facility location games with optional preference
- 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
- Two-facility-location games with mixed types of agents
- On Discrete Truthful Heterogeneous Two-Facility Location
- Obnoxious facility location games with candidate locations
- Truthful two-facility location with candidate locations
- On truthful constrained heterogeneous facility location with max-variant cost
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 Q6652456)
