Constrained heterogeneous facility location games with max-variant cost

DOI10.1007/s10878-023-01017-6OpenAlexW4362588740MaRDI QIDQ2698023

Qingqin Nong, Qi Zhao, Qizhi Fang, Wenjing Liu

Publication date: 14 April 2023

Published in: Journal of Combinatorial Optimization (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

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• 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
• 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

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