On the complexity of achieving proportional representation

Ariel D. Procaccia; Jeffrey S. Rosenschein; Aviv Zohar

doi:10.1007/s00355-007-0235-2

On the complexity of achieving proportional representation

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

151 Scopus citations

Abstract

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 language	American English
Pages (from-to)	353-362
Number of pages	10
Journal	Social Choice and Welfare
Volume	30
Issue number	3
DOIs	https://doi.org/10.1007/s00355-007-0235-2
State	Published - Apr 2008

Access to Document

10.1007/s00355-007-0235-2

Cite this

@article{db06dc684c3746199e66bbe48d844d88,

title = "On the complexity of achieving proportional representation",

abstract = "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.",

author = "Procaccia, {Ariel D.} and Rosenschein, {Jeffrey S.} and Aviv Zohar",

year = "2008",

month = apr,

doi = "10.1007/s00355-007-0235-2",

language = "American English",

volume = "30",

pages = "353--362",

journal = "Social Choice and Welfare",

issn = "0176-1714",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - On the complexity of achieving proportional representation

AU - Procaccia, Ariel D.

AU - Rosenschein, Jeffrey S.

AU - Zohar, Aviv

PY - 2008/4

Y1 - 2008/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39349107060&partnerID=8YFLogxK

U2 - 10.1007/s00355-007-0235-2

DO - 10.1007/s00355-007-0235-2

M3 - Article

AN - SCOPUS:39349107060

SN - 0176-1714

VL - 30

SP - 353

EP - 362

JO - Social Choice and Welfare

JF - Social Choice and Welfare

IS - 3

ER -

On the complexity of achieving proportional representation

Abstract

Access to Document

Other files and links

Fingerprint

Cite this