메뉴 건너뛰기




Volumn 30, Issue 3, 2008, Pages 353-362

On the complexity of achieving proportional representation

Author keywords

[No Author keywords available]

Indexed keywords


EID: 39349107060     PISSN: 01761714     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00355-007-0235-2     Document Type: Article
Times cited : (205)

References (15)
  • 1
    • 0001511919 scopus 로고
    • Single transferable vote resists strategic voting
    • Bartholdi J, Orlin J (1991) Single transferable vote resists strategic voting. Soc Choice Welf 8:341-354
    • (1991) Soc Choice Welf , vol.8 , pp. 341-354
    • Bartholdi, J.1    Orlin, J.2
  • 2
    • 0000733155 scopus 로고
    • The computational difficulty of manipulating an election
    • Bartholdi J, Tovey CA, Trick MA (1989) The computational difficulty of manipulating an election. Soc Choice Welf 6:227-241
    • (1989) Soc Choice Welf , vol.6 , pp. 227-241
    • Bartholdi, J.1    Tovey, C.A.2    Trick, M.A.3
  • 3
    • 0012257673 scopus 로고
    • Voting schemes for which it can be difficult to tell who won the election
    • Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6:157-165
    • (1989) Soc Choice Welf , vol.6 , pp. 157-165
    • Bartholdi, J.1    Tovey, C.A.2    Trick, M.A.3
  • 4
  • 5
    • 33645570323 scopus 로고
    • Representative deliberations and representative decisions: Proportional representation and the Borda rule
    • 3
    • Chamberlin JR, Courant PN (1983) Representative deliberations and representative decisions: Proportional representation and the Borda rule. Am Polit Sci Rev 77(3):718-733
    • (1983) Am Polit Sci Rev , vol.77 , pp. 718-733
    • Chamberlin, J.R.1    Courant, P.N.2
  • 9
    • 0018678438 scopus 로고
    • An algorithmic approach to nework location problems. part ii: The p-medians
    • 3
    • Kariv O, Hakimi L (1979) An algorithmic approach to nework location problems. part ii: The p-medians. SIAM J Appl Math 37(3):539-560
    • (1979) SIAM J Appl Math , vol.37 , pp. 539-560
    • Kariv, O.1    Hakimi, L.2
  • 10
    • 84937295373 scopus 로고
    • Fully proportional representation
    • 4
    • Monroe BL (1995) Fully proportional representation. Am Polit Sci Rev 89(4):925-940
    • (1995) Am Polit Sci Rev , vol.89 , pp. 925-940
    • Monroe, B.L.1
  • 11
    • 0019623858 scopus 로고
    • On the complexity of integer programming
    • Papadimitriou CH (1981) On the complexity of integer programming. J Assoc Comput Mach 28(4)
    • (1981) J Assoc Comput Mach , vol.28 , Issue.4
    • Ch, P.1
  • 13
    • 0039503915 scopus 로고    scopus 로고
    • Proportional representation: Broadening the options
    • Potthoff RF, Brams SJ (1998) Proportional representation: broadening the options. J Theor Polit 10(2)
    • (1998) J Theor Polit , vol.10 , Issue.2
    • Potthoff, R.F.1    Brams, S.J.2
  • 14
    • 34249029918 scopus 로고    scopus 로고
    • Junta distributions and the average-case complexity of manipulating elections
    • Procaccia AD, Rosenschein JS (2007) Junta distributions and the average-case complexity of manipulating elections. J Artif Intell Res 28:157-181
    • (2007) J Artif Intell Res , vol.28 , pp. 157-181
    • Procaccia, A.D.1    Rosenschein, J.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.