Document

# On β-Plurality Points in Spatial Voting Games

## File

LIPIcs.SoCG.2020.7.pdf
• Filesize: 0.8 MB
• 15 pages

## Acknowledgements

The authors would like to thank Sampson Wong for improving an earlier version of Lemma 2.6.

## Cite As

Boris Aronov, Mark de Berg, Joachim Gudmundsson, and Michael Horton. On β-Plurality Points in Spatial Voting Games. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.SoCG.2020.7

## Abstract

Let V be a set of n points in ℝ^d, called voters. A point p ∈ ℝ^d is a plurality point for V when the following holds: for every q ∈ ℝ^d the number of voters closer to p than to q is at least the number of voters closer to q than to p. Thus, in a vote where each v ∈ V votes for the nearest proposal (and voters for which the proposals are at equal distance abstain), proposal p will not lose against any alternative proposal q. For most voter sets a plurality point does not exist. We therefore introduce the concept of β-plurality points, which are defined similarly to regular plurality points except that the distance of each voter to p (but not to q) is scaled by a factor β, for some constant 0<β⩽1. We investigate the existence and computation of β-plurality points, and obtain the following results. - Define β^*_d := sup{β : any finite multiset V in ℝ^d admits a β-plurality point}. We prove that β^*₂ = √3/2, and that 1/√d ⩽ β^*_d ⩽ √3/2 for all d⩾3. - Define β(V) := sup {β : V admits a β-plurality point}. We present an algorithm that, given a voter set V in {ℝ}^d, computes an (1-ε)⋅ β(V) plurality point in time O(n²/ε^(3d-2) ⋅ log(n/ε^(d-1)) ⋅ log²(1/ε)).

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Design and analysis of algorithms
##### Keywords
• Computational geometry
• Spatial voting theory
• Plurality point
• Computational social choice

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Boris Aronov, Mark de Berg, Joachim Gudmundsson, and Michael Horton. On β-plurality points in spatial voting games, 2020. URL: http://arxiv.org/abs/2003.07513.
2. Sunil Arya and David M. Mount. Approximate range searching. Computational Geometry - Theory & Applications, 17(3):135-152, 2000.
3. Saugata Basu, Richard Pollack, and Marie-Françoise Roy. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics). Springer-Verlag, Berlin, Heidelberg, 2006.
4. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer-Verlag, 3rd edition, 2008.
5. Mark De Berg, Joachim Gudmundsson, and Mehran Mehr. Faster algorithms for computing plurality points. ACM Transactions on Algorithms, 14(3), 2018.
6. Duncan Black. On the rationale of group decision-making. Journal of Political Economy, 56(1):23-34, 1948.
7. Jonathan Chung. Optimally locating a new candidate in spatial and valence models of voting games, 2018. Honours thesis, University of Sydney.
8. Richard Cole, Jeffrey S. Salowe, William L. Steiger, and Endre Szemerédi. An optimal-time algorithm for slope selection. SIAM Journal on Computing, 18(4):792-810, 1989.
9. Tamal K. Dey. Improved bounds for planar k-sets and related problems. Discrete and Computational Geometry, 19(3):373-382, 1998.
10. Anthony Downs. An Economic Theory of Political Action in a Democracy. Journal of Political Economy, 65(2):135-135, 1957.
11. Adrian Dumitrescu, János Pach, and Géza Tóth. Drawing Hamiltonian cycles with no large angles. The Electronic Journal of Combinatorics, 19(2):P31, 2012.
12. James Enelow and Melvin Hinisch. On Plott’s pairwise symmetry condition for majority rule equilibrium. Public Choice, 40(3):317-321, 1983.
13. Haldun Evrenk. Valence politics. In Roger D. Congleton, Bernard Grofman, Stefan Voigt, and Haldun Evrenk, editors, Oxford Handbook of Public Choice, chapter 13. Oxford University Press, 2019.
14. Scott Feld, Bernard Grofman, and Nicholas Miller. Centripetal forces in spatial voting: On the size of the yolk. Public Choice, 59:37-50, October 1988.
15. Noah Giansiracusa and Cameron Ricciardi. Computational geometry and the U.S. supreme court. Math. Soc. Sci., 98:1-9, 2019.
16. Fabian Gouret, Guillaume Hollard, and Stéphane Rossignol. An empirical analysis of valence in electoral competition. Social Choice and Welfare, 37(2):309-340, 2011.
17. Joachim Gudmundsson and Sampson Wong. Computing the yolk in spatial voting games without computing median lines. In The 33rd AAAI Conference on Artificial Intelligence, pages 2012-2019. AAAI Press, 2019.
18. Helios Herrera, David K. Levine, and César Martinelli. Policy platforms, campaign spending and voter participation. Journal of Public Economics, 92(3):501-513, 2008.
19. Guillaume Hollard and Stéphane Rossignol. An alternative approach to valence advantage in spatial competition. Journal of Public Economic Theory, 10(3):441-454, 2008.
20. Vladlen Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. Journal of the ACM, 51(5):699-730, 2004.
21. Richard D. McKelvey. Covering, dominance, and institution-free properties of social choice. American Journal of Political Science, 30(2):283-314, 1986.
22. Nicholas R. Miller. The spatial model of social choice and voting. In Jac C. Heckelman and Nicholas R. Miller, editors, Handbook of Social Choice and Voting, chapter 10, pages 163-181. Edward Elgar Publishing, 2015.
23. Charles R. Plott. A notion of equilibrium and its possibility under majority rule. The American Economic Review, 57(4):787-806, 1967.
24. David Sanders, Harold D. Clarke, Marianne C. Stewart, and Paul Whiteley. Downs, stokes and the dynamics of electoral choice. British Journal of Political Science, 41(2):287-314, 2011.
25. Micha Sharir and Pankaj K. Agarwal. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, 1995.
26. Donald E. Stokes. Spatial models of party competition. American Political Science Review, 57(2):368-377, 1963.
27. Alan E. Wiseman. A theory of partisan support and entry deterrence in electoral competition. Journal of Theoretical Politics, 18(2):123-158, 2006.
28. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, and Kun-Mao Chao. Computing plurality points and condorcet points in Euclidean space. In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), volume 8283 of Lecture Notes in Computer Science, pages 688-698. Springer, 2013.
X

Feedback for Dagstuhl Publishing