-
1
-
-
68549127908
-
Approximating power indices
-
Bachrach, Y.; Markakis, E.; Procaccia, A. D.; Rosenschein, J. S.; and Saberi, A. 2008. Approximating power indices. In Proc. of AAMAS'08, 943-950.
-
(2008)
Proc. of AAMAS'08
, pp. 943-950
-
-
Bachrach, Y.1
Markakis, E.2
Procaccia, A. D.3
Rosenschein, J. S.4
Saberi, A.5
-
2
-
-
0001511919
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
12
-
-
77958608755
-
Evaluation of election outcomes under uncertainty
-
Hazon, N.; Aumann, Y.; Kraus, S.; and Wooldridge, M. 2008. Evaluation of election outcomes under uncertainty. In Proc. 7th AAMAS'08, 959-966.
-
(2008)
Proc. 7th AAMAS'08
, pp. 959-966
-
-
Hazon, N.1
Aumann, Y.2
Kraus, S.3
Wooldridge, M.4
-
13
-
-
84947403595
-
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
-
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
-
16
-
-
84880880360
-
Winner determination in sequential majority voting
-
Lang, J.; Pini, M.; Rossi, F.; Venable, K.; and Walsh, T. 2007. Winner determination in sequential majority voting. In Proc. of IJCAI'07, 1372-1377.
-
(2007)
Proc. of IJCAI'07
, pp. 1372-1377
-
-
Lang, J.1
Pini, M.2
Rossi, F.3
Venable, K.4
Walsh, T.5
-
17
-
-
49249151236
-
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
-
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
-
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
-
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
-
21
-
-
78751683337
-
Complexity of unweighted coalitional manipulation under some common voting rules
-
Xia, L.; Zuckerman, M.; Procaccia, A.; Conitzer, V.; and Rosenschein, J. 2009. Complexity of unweighted coalitional manipulation under some common voting rules. In Proc. 21st IJCAI'09.
-
(2009)
Proc. 21st IJCAI'09
-
-
Xia, L.1
Zuckerman, M.2
Procaccia, A.3
Conitzer, V.4
Rosenschein, J.5
|