Two homogeneous facility location games with a minimum distance requirement on a circle

DOI10.1016/j.tcs.2024.114398MaRDI QIDQ6122598

Guo-Chuan Zhang, Xiao-Yu Wu, Lili Mei

Publication date: 1 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

facility location gamesapproximation ratiosstrategyproof mechanism design

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Strategy-proof approximation mechanisms for an obnoxious facility game on networks
• Strategy-proof location on a network
• Mechanism design for two-opposite-facility location games with penalties on distance
• Facility location games with optional preference
• Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
• Characterizing Mechanisms in Obnoxious Facility Game
• 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 homogeneous facility location games with a minimum distance requirement on a circle