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

DOI10.1016/J.TCS.2017.09.020zbMATH Open1394.91170OpenAlexW2758948568MaRDI QIDQ2636498FDOQ2636498

Guochuan Zhang, Lili Mei, Deshi Ye

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) Auctions, bargaining, bidding and selling, and other market models (91B26) Discrete location and assignment (90B80)

Cites Work

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

Cited In (2)

• Two-facility location games with a minimum distance requirement on a circle
• Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636498)