Multiple facility location games with envy ratio
From MaRDI portal
Publication:5925504
DOI10.1016/j.tcs.2021.01.016zbMath1482.91059OpenAlexW4205277288MaRDI QIDQ5925504
Wenjing Liu, Qingqin Nong, Yuan Ding, Xin Chen, Qizhi Fang
Publication date: 8 April 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.01.016
Applications of game theory (91A80) Discrete location and assignment (90B80) Mechanism design theory (91B03)
Related Items (5)
Two-facility location games with a minimum distance requirement on a circle ⋮ Facility location games with ordinal preferences ⋮ Two homogeneous facility location games with a minimum distance requirement on a circle ⋮ Constrained heterogeneous two-facility location games with max-variant cost ⋮ Constrained heterogeneous 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
This page was built for publication: Multiple facility location games with envy ratio
