Multiple facility location games with envy ratio
From MaRDI portal
Publication:5918333
DOI10.1007/978-3-030-57602-8_23zbMath1482.91060OpenAlexW3123730017MaRDI QIDQ5918333
Xin Chen, Qizhi Fang, Qingqin Nong, Yuan Ding, Wenjing Liu
Publication date: 5 July 2021
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_23
Applications of game theory (91A80) Discrete location and assignment (90B80) Mechanism design theory (91B03)
Related Items (3)
A cost-sharing scheme for the \(k\)-level facility location game with penalties ⋮ Strategyproof mechanisms for \(2\)-facility location games with minimax envy ⋮ Constrained heterogeneous two-facility location games with max-variant cost
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
- Mechanism design for two-opposite-facility location games with penalties on distance
- Facility location games with distinct desires
- Strategyproof Approximation of the Minimax on Networks
- Facility location games with optional preference
- On the Power of Deterministic Mechanisms for Facility Location Games
This page was built for publication: Multiple facility location games with envy ratio