Loading...
Please wait, while we are loading the content...
Similar Documents
Computing a Condorcet winner of a 1-Euclidean election
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lin, Po-Ting Wang, Hung-Lung Chao, Kun-Mao |
| Copyright Year | 2018 |
| Abstract | In this paper, we are concerned with the problem of deploying public facilities via a 1-Euclidean election under the majority rule. In a 1-Euclidean election, voters and candidates can be mapped into R, and each voter’s preference is determined by the distances from the voter to the candidates. Specifically, each candidate considered in this work consists of arbitrary k points, and the winner is determined with Condorcet criterion. Given that k is fixed, we show that determining whether a Condorcet winner exists can be done in time linear to the number of voters. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.cs.rpi.edu/~xial/COMSOC18/papers/paper%2022.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
