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 - ???researchoutput.researchoutputtypes.contributiontojournal.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 -