메뉴 건너뛰기




Volumn , Issue , 2010, Pages 697-702

Probabilistic Possible Winner Determination

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

EID: 78449287362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (21)
  • 2
    • 0001511919 scopus 로고
    • Single transferable vote resists strategic voting
    • Bartholdi, III, J., and Orlin, J. 1991. Single transferable vote resists strategic voting. Social Choice and Welfare 8(4):341-354.
    • (1991) Social Choice and Welfare , vol.8 , Issue.4 , pp. 341-354
    • Bartholdi, J.1    Orlin, J.2
  • 3
    • 0000733155 scopus 로고
    • The computational difficulty of manipulating an election
    • Bartholdi, J.; Tovey, C.; and Trick, M. 1989. The computational difficulty of manipulating an election. Social Choice and Welfare 6(3):227-241.
    • (1989) Social Choice and Welfare , vol.6 , Issue.3 , pp. 227-241
    • Bartholdi, J.1    Tovey, C.2    Trick, M.3
  • 4
    • 70349303465 scopus 로고    scopus 로고
    • Towards a dichotomy of finding possible winners in elections based on scoring rules
    • Betzler, N., and Dorn, B. 2009. Towards a dichotomy of finding possible winners in elections based on scoring rules. In Proc. of MFCS'09, 124-136.
    • (2009) Proc. of MFCS'09 , pp. 124-136
    • Betzler, N.1    Dorn, B.2
  • 5
    • 78751700282 scopus 로고    scopus 로고
    • A multivariate complexity analysis of determining possible winners given incomplete votes
    • Betzler, N.; Hemmann, S.; and Niedermeier, R. 2009. A multivariate complexity analysis of determining possible winners given incomplete votes. In Proc. of IJCAI'09.
    • (2009) Proc. of IJCAI'09
    • Betzler, N.1    Hemmann, S.2    Niedermeier, R.3
  • 6
    • 0013157009 scopus 로고
    • Counting linear extensions
    • Brightwell, G., and Winkler, P. 1991. Counting linear extensions. Order 8(3):225-242.
    • (1991) Order , vol.8 , Issue.3 , pp. 225-242
    • Brightwell, G.1    Winkler, P.2
  • 7
    • 34250337396 scopus 로고    scopus 로고
    • When are elections with few candidates hard to manipulate?
    • Conitzer, V.; Sandholm, T.; and Lang, J. 2007. When are elections with few candidates hard to manipulate? J. ACM 54(3):1-33.
    • (2007) J. ACM , vol.54 , Issue.3 , pp. 1-33
    • Conitzer, V.1    Sandholm, T.2    Lang, J.3
  • 8
    • 0000138929 scopus 로고
    • On the complexity of cooperative solution concepts
    • Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2):257-266.
    • (1994) Math. Oper. Res , vol.19 , Issue.2 , pp. 257-266
    • Deng, X.1    Papadimitriou, C. H.2
  • 13
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301):13-30.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 14
    • 33644929512 scopus 로고    scopus 로고
    • Fast perfect sampling from linear extensions
    • Huber, M. 2006. Fast perfect sampling from linear extensions. Discrete Mathematics 306(4):420-428.
    • (2006) Discrete Mathematics , vol.306 , Issue.4 , pp. 420-428
    • Huber, M.1
  • 17
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • Valiant, L. 1979. The complexity of computing the permanent. Theor. Comp. Sci. 8(2):189-201.
    • (1979) Theor. Comp. Sci , vol.8 , Issue.2 , pp. 189-201
    • Valiant, L.1
  • 18
    • 85167414701 scopus 로고    scopus 로고
    • Uncertainty in preference elicitation and aggregation
    • Walsh, T. 2007. Uncertainty in preference elicitation and aggregation. In Proc. of AAAI'07, 3-8.
    • (2007) Proc. of AAAI'07 , pp. 3-8
    • Walsh, T.1
  • 19
    • 57749173631 scopus 로고    scopus 로고
    • Determining possible and necessary winners under common voting rules given partial orders
    • Xia, L., and Conitzer, V. 2008a. Determining possible and necessary winners under common voting rules given partial orders. In Proc. of AAAI'08, 196-201.
    • (2008) Proc. of AAAI'08 , pp. 196-201
    • Xia, L.1    Conitzer, V.2
  • 20
    • 58849101929 scopus 로고    scopus 로고
    • Generalized scoring rules and the frequency of coalitional manipulability
    • Xia, L., and Conitzer, V. 2008b. Generalized scoring rules and the frequency of coalitional manipulability. In Proc. of EC'08, 109-118.
    • (2008) Proc. of EC'08 , pp. 109-118
    • Xia, L.1    Conitzer, V.2


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