On the complexity of achieving proportional representation

Ariel D. Procaccia*, Jeffrey S. Rosenschein, Aviv Zohar

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

155 Scopus citations


We demonstrate that winner selection in two prominent proportional representation voting systems is a computationally intractable problem-implying that these systems are impractical when the assembly is large. On a different note, in settings where the size of the assembly is constant, we show that the problem can be solved in polynomial time.

Original languageAmerican English
Pages (from-to)353-362
Number of pages10
JournalSocial Choice and Welfare
Issue number3
StatePublished - Apr 2008


Dive into the research topics of 'On the complexity of achieving proportional representation'. Together they form a unique fingerprint.

Cite this