Mechanism design for one-facility location game with obnoxious effects on a line (Q2636498): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2017.09.020
@@ Property / DOI: 10.1016/j.tcs.2017.09.020 / rank @@
-Normal rank
@@ Property / cites work @@
+Strategyproof Approximation of the Minimax on Networks
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Game with a Bounded Service Range
+Normal rank
@@ Property / cites work @@
+Mechanisms for Obnoxious Facility Game on a Path
@@ Property / cites work: Mechanisms for Obnoxious Facility Game on a Path / rank @@
+Normal rank
@@ Property / cites work @@
+Strategy-Proof Mechanisms for Facility Location Games with Many Facilities
+Normal rank
@@ Property / cites work @@
+Characterizing Mechanisms in Obnoxious Facility Game
+Normal rank
@@ Property / cites work @@
+Solving the semi-desirable facility location problem using bi-objective particle swarm
+Normal rank
@@ Property / cites work @@
+Strategy-Proof Mechanism for Obnoxious Facility Location on a Line
+Normal rank
@@ Property / cites work @@
+Strategyproof mechanism design for facility location games with weighted agents on a line
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2017.09.020
@@ Property / DOI: 10.1016/J.TCS.2017.09.020 / rank @@
+Normal rank