Constrained truthful obnoxious two-facility location with optional preferences

DOI10.1007/978-3-032-03639-1_8MaRDI QIDQ6851610zbMATH OpenFDO

Authors Panagiotis Kanellopoulos, Alexandros A. Voudouris

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-03639-1_8

zbMATH Keywords

approximationmechanism designobnoxious facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Mechanism design theory (91B03)

Cites work

• Agent-constrained truthful facility location games
• Algorithms for strategyproof classification
• Approximation strategy-proof mechanisms for obnoxious facility location on a line
• Constrained heterogeneous two-facility location games with sum-variant
• Facility location games with optional preference
• Heterogeneous facility location with limited resources
• Heterogeneous facility location without money
• Mechanism design with predictions for facility location games with candidate locations
• Obnoxious facility location games with candidate locations
• On Discrete Truthful Heterogeneous Two-Facility Location
• Strategy-proof approximation mechanisms for an obnoxious facility game on networks
• The design of approximation algorithms
• The obnoxious facility location game with dichotomous preferences
• Truthful two-facility location with candidate locations
• Two homogeneous facility location games with a minimum distance requirement on a circle
• Two-facility location games with minimum distance requirement

Cited in

(1)

• Constrained distributed heterogeneous two-facility location problems with max-variant cost

This page was built for publication: Constrained truthful obnoxious two-facility location with optional preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851610)