Constrained heterogeneous two-facility location games with max-variant cost

DOI10.1007/978-3-031-20796-9_3zbMath1529.90050arXiv2207.03026MaRDI QIDQ6166872

Qizhi Fang, Wenjing Liu, Qi Zhao, Qingqin Nong

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.03026

zbMATH Keywords

facility locationmechanism designconstrainedstrategyproof

Mathematics Subject Classification ID

Applications of game theory (91A80) Discrete location and assignment (90B80) Mechanism design theory (91B03)

Cites Work

• Heterogeneous facility location without money
• Strategy-proof approximation mechanisms for an obnoxious facility game on networks
• Strategyproof mechanism design for facility location games with weighted agents on a line
• Strategy-proof location on a network
• Strategyproof mechanisms for 2-facility location games with minimax envy
• The capacity constrained facility location problem
• Facility location games with distinct desires
• Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
• Mechanism design for facility location games with candidate locations
• Facility location games with optional preference
• On the Power of Deterministic Mechanisms for Facility Location Games
• Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing L_p Norm of Costs
• Two-facility Location Games with Minimum Distance Requirement
• Multiple facility location games with envy ratio
• Multiple facility location games with envy ratio

This page was built for publication: Constrained heterogeneous two-facility location games with max-variant cost