Abstract
This work concerns two kinds of spatial equilibria. Given a multiset of n points in Euclidean space equipped with the l2-norm, we call a location a plurality point if it is closer to at least as many given points as any other location. A location is called a Condorcet point if there exists no other location which is closer to an absolute majority of the given points. In d-dimensional Euclidean space ℝ d , we show that the plurality points and the Condorcet points are equivalent. When the given points are not collinear, the Condorcet point (which is also the plurality point) is unique in ℝ d if such a point exists. To the best of our knowledge, no efficient algorithm has been proposed for finding the point if the dimension is higher than one. In this paper, we present an O(n d − 1 logn)-time algorithm for any fixed dimension d ≥ 2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
