Two-facility location games with a minimum distance requirement on a circle
From MaRDI portal
Publication:2150574
DOI10.1007/978-3-030-92681-6_39OpenAlexW4206761547MaRDI QIDQ2150574
Lili Mei, Xiao-Yu Wu, Guo-Chuan Zhang
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_39
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Cites Work
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Strategy-proof location on a network
- Facility location games with optional preference
- Strategy-proof mechanisms for obnoxious facility game with bounded service range
- Facility location games with distinct desires
- Mechanism design for one-facility location game with obnoxious effects on a line
- Characterizing Mechanisms in Obnoxious Facility Game
- Strategyproof Approximation of the Minimax on Networks
- Mechanisms for Obnoxious Facility Game on a Path
- Two-facility Location Games with Minimum Distance Requirement
- Multiple facility location games with envy ratio
This page was built for publication: Two-facility location games with a minimum distance requirement on a circle
