Name
Abstract | ||
|---|---|---|
This work concerns two kinds of spatial equilibria. Given a multiset of n points in Euclidean space equipped with the l(2)-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 R-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 R-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) log n)-time algorithm for any fixed dimension d >= 2. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-45030-3_64 | ALGORITHMS AND COMPUTATION |
Field | DocType | Volume |
Set function,Linear separability,Discrete mathematics,Combinatorics,Multiset,Convex hull,Euclidean space,Closest pair of points problem,Euclidean distance matrix,Mathematics,Condorcet method | Conference | 8283 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.48 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yen-Wei Wu | 1 | 20 | 2.44 |
| Wei-Yin Lin | 2 | 5 | 1.63 |
| Hung-Lung Wang | 3 | 27 | 5.63 |
| Kun-mao Chao | 4 | 838 | 94.05 |