Mechanism design for one-facility location game with obnoxious effects on a line

DOI10.1016/j.tcs.2017.09.020zbMath1394.91170OpenAlexW2758948568MaRDI QIDQ2636498

Lili Mei, Deshi Ye, Guo-Chuan Zhang

Publication date: 5 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.020

zbMATH Keywords

approximation algorithmmechanism designfacility location game

Mathematics Subject Classification ID

Applications of game theory (91A80) Discrete location and assignment (90B80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

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

Cites Work

• Strategyproof mechanism design for facility location games with weighted agents on a line
• Solving the semi-desirable facility location problem using bi-objective particle swarm
• Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
• Characterizing Mechanisms in Obnoxious Facility Game
• Strategyproof Approximation of the Minimax on Networks
• Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
• Obnoxious Facility Game with a Bounded Service Range
• Mechanisms for Obnoxious Facility Game on a Path

This page was built for publication: Mechanism design for one-facility location game with obnoxious effects on a line