Faster Algorithms for Computing Plurality Points

Let V be a set of n points in Rd, which we call voters. A point p ∈ Rd is preferred over another point p′ ∈ Rd by a voter υ ∈ V if dist(υ, p) < dist(υ, p′). A point p is called a plurality point if it is preferred by at least as many voters as any other point p′. We present an algorithm that decides in O(nlogn) time whether V admits a plurality point in the L2 norm and, if so, finds the (unique) plurality point. We also give efficient algorithms to compute a minimum-cost subset W ⊂ V such that V\W admits a plurality point, and to compute a so-called minimum-radius plurality ball. Finally, we consider the problem in the personalized L1 norm, where each point υ ∈ V has a preference vector ⟨w1(υ),…,wd(υ)⟩ and the distance from υ to any point p ∈ Rd is given by ∑i=1d wi(υ)· |xi(υ)−xi(p)|. For this case we can compute in O(nd−1) time the set of all plurality points of V. When all preference vectors are equal, the running time improves to O(n).

[1]  Richard E. Wendell,et al.  Some Generalizations of Social Decisions under Majority Rule , 1974 .

[2]  Timothy M. Chan An optimal randomized algorithm for maximum Tukey depth , 2004, SODA '04.

[3]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[4]  Dominik Kress,et al.  Sequential competitive location on networks , 2013, Eur. J. Oper. Res..

[5]  Pierre Hansen,et al.  Equivalence of Solutions to Network Location Problems , 1986, Math. Oper. Res..

[6]  Jacques-François Thisse,et al.  Outcomes of voting and planning: Condorcet, Weber and Rawls locations , 1981 .

[7]  Jirí Matousek,et al.  The one-round Voronoi game , 2002, SCG '02.

[8]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[9]  R. E. Wendell,et al.  New perspectives in competitive location theory , 1981 .

[10]  Asish Mukhopadhyay,et al.  An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons , 1996, J. Algorithms.

[11]  Tammy Drezner,et al.  Competitive Facility Location in the Plane , 1995 .

[12]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[13]  R. E. Wendell,et al.  Voting Equilibria in Multidimensional Choice Spaces , 1976, Math. Oper. Res..

[14]  Gilbert Laporte,et al.  Sequential location problems , 1997 .

[15]  Jeff Erickson New Lower Bounds for Convex Hull Problems in Odd Dimensions , 1999, SIAM J. Comput..

[16]  Kun-Mao Chao,et al.  Computing Plurality Points and Condorcet Points in Euclidean Space , 2013, ISAAC.

[17]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  Kun-Mao Chao,et al.  Forming Plurality at Minimum Cost , 2015, WALCOM.

[19]  Charles R. Plott,et al.  A Notion of Equilibrium and Its Possibility Under Majority Rule , 1967 .

[20]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[21]  Otfried Cheong,et al.  Competitive facility location: the Voronoi game , 2004, Theor. Comput. Sci..

[22]  Nina Amenta,et al.  Helly-type theorems and Generalized Linear Programming , 1994, Discret. Comput. Geom..