Name
Abstract | ||
|---|---|---|
In this paper, we are concerned with a kind of spatial equilibria, the plurality points, in two-dimensional Euclidean space. Given a set of voters, each of which corresponds to a point, a plurality point is defined as a point closer to at least as many voters as any other point in the space. We generalize the definition by appending weights on the voters, and define the plurality point as a point (vartriangle) satisfying that the sum of weights of the voters closer to (vartriangle) is no less than that of the voters closer to any other point in the space. To remedy the issue of the non-existence of plurality points, we investigate the problem of eliminating some voters with minimum “cost” so that there is a plurality point with respect to the remaining voters. We show that the problem is NP-hard. Moreover, if all voters’ weights are restricted to be equal, we show that the problem can be solved in O(n5logn) time, where n is the number of voters. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-15612-5_8 | WALCOM |
Field | DocType | Citations |
Dynamic programming,Discrete mathematics,Combinatorics,Computer science,Euclidean space,Unit circle,Facility location problem | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei-Yin Lin | 1 | 5 | 1.63 |
| Yen-Wei Wu | 2 | 20 | 2.44 |
| Hung-Lung Wang | 3 | 27 | 5.63 |
| Kun-mao Chao | 4 | 838 | 94.05 |