메뉴 건너뛰기




Volumn 5734 LNCS, Issue , 2009, Pages 124-136

Towards a dichotomy of finding possible winners in elections based on scoring rules

Author keywords

[No Author keywords available]

Indexed keywords

JOINT DECISIONS; LINEAR ORDER; NP COMPLETE; NP-HARDNESS; PARTIAL ORDER; POLYNOMIAL-TIME; SCORING RULES; SCORING VECTORS; VOTING PROTOCOLS;

EID: 70349303465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_12     Document Type: Conference Paper
Times cited : (26)

References (12)
  • 1
    • 78751700282 scopus 로고    scopus 로고
    • A multivariate complexity analysis of determining possible winners given incomplete votes
    • Betzler, N., Hemmann, S., Niedermeier, R.: A multivariate complexity analysis of determining possible winners given incomplete votes. In: Proc. of 21st IJCAI 2009 (2009)
    • (2009) Proc. of 21st IJCAI 2009
    • Betzler, N.1    Hemmann, S.2    Niedermeier, R.3
  • 2
    • 34250337396 scopus 로고    scopus 로고
    • When are elections with few candidates hard to manipulate?
    • Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM 54(3), 1-33 (2007)
    • (2007) Journal of the ACM , vol.54 , Issue.3 , pp. 1-33
    • Conitzer, V.1    Sandholm, T.2    Lang, J.3
  • 3
    • 68349118040 scopus 로고    scopus 로고
    • Nonuniform bribery (short paper)
    • Faliszewski, P.: Nonuniform bribery (short paper). In: Proc. 7th AAMAS 2008, pp. 1569-1572 (2008)
    • (2008) Proc. 7th AAMAS 2008 , pp. 1569-1572
    • Faliszewski, P.1
  • 4
    • 58049126575 scopus 로고    scopus 로고
    • On the parameterized complexity of multiple-interval graph problems
    • Fellows,M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. TCS 410(1), 53-61 (2009)
    • (2009) TCS , vol.410 , Issue.1 , pp. 53-61
    • Fellows, M.R.1    Hermelin, D.2    Rosamond, F.A.3    Vialette, S.4
  • 6
    • 33846161182 scopus 로고    scopus 로고
    • Voting procedures with incomplete preferences
    • Multidisciplinary Workshop on Advances in Preference Handling
    • Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proc. of IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling (2005)
    • (2005) Proc. of IJCAI 2005
    • Konczak, K.1    Lang, J.2
  • 8
  • 9
    • 36348984460 scopus 로고    scopus 로고
    • Uncertainty in preference elicitation and aggregation
    • AAAI Press, Menlo Park
    • Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proc. of 22nd AAAI 2007, pp. 3-8. AAAI Press, Menlo Park (2007)
    • (2007) Proc. of 22nd AAAI 2007 , pp. 3-8
    • Walsh, T.1
  • 10
    • 57749173631 scopus 로고    scopus 로고
    • Determining possible and necessary winners under common voting rules given partial orders
    • AAAI Press, Menlo Park
    • Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proc. of 23rd AAAI 2008, pp. 196-201. AAAI Press, Menlo Park (2008)
    • (2008) Proc. of 23rd AAAI 2008 , pp. 196-201
    • Xia, L.1    Conitzer, V.2


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