On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case
Abstract
Open list proportional representation is an election mechanism used in many elections, including the 2012 Hong Kong Legislative Council Geographical Constituencies election. In this paper, we assume that there are just two parties in the election, and that the number of votes that a list would get is the sum of the numbers of votes that the candidates in the list would get if each of them would go alone in the election. Under these assumptions, we formulate the election as a mostly zero-sum game, and show that while the game always has a pure Nash equilibrium, it is NP-hard to compute it.
Cite
Text
Ding and Lin. "On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case." AAAI Conference on Artificial Intelligence, 2014. doi:10.1609/AAAI.V28I1.8888Markdown
[Ding and Lin. "On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case." AAAI Conference on Artificial Intelligence, 2014.](https://mlanthology.org/aaai/2014/ding2014aaai-computing/) doi:10.1609/AAAI.V28I1.8888BibTeX
@inproceedings{ding2014aaai-computing,
title = {{On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case}},
author = {Ding, Ning and Lin, Fangzhen},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2014},
pages = {1419-1425},
doi = {10.1609/AAAI.V28I1.8888},
url = {https://mlanthology.org/aaai/2014/ding2014aaai-computing/}
}