-
1
-
-
78751700282
-
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
-
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
-
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
-
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
-
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
-
7
-
-
84880880360
-
Winner determination in sequential majority voting
-
Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: Proc. of 20th IJCAI 2007, pp. 1372-1377 (2007)
-
(2007)
Proc. of 20th IJCAI 2007
, pp. 1372-1377
-
-
Lang, J.1
Pini, M.S.2
Rossi, F.3
Venable, K.B.4
Walsh, T.5
-
8
-
-
84880869369
-
Incompleteness and incomparability in preference aggregation
-
Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Incompleteness and incomparability in preference aggregation. In: Proc. of 20th IJCAI 2007, pp. 1464-1469 (2007)
-
(2007)
Proc. of 20th IJCAI 2007
, pp. 1464-1469
-
-
Pini, M.S.1
Rossi, F.2
Venable, K.B.3
Walsh, T.4
-
9
-
-
36348984460
-
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
-
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
-
11
-
-
78751683337
-
Complexity of unweighted coalitional manipulation under some common voting rules
-
Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: Proc. 21st IJCAI 2009 (2009)
-
(2009)
Proc. 21st IJCAI 2009
-
-
Xia, L.1
Zuckerman, M.2
Procaccia, A.D.3
Conitzer, V.4
Rosenschein, J.S.5
-
12
-
-
57749118587
-
Algorithms for the coalitional manipulation problem
-
Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. Artificial Intelligence 173(2), 392-412 (2009)
-
(2009)
Artificial Intelligence
, vol.173
, Issue.2
, pp. 392-412
-
-
Zuckerman, M.1
Procaccia, A.D.2
Rosenschein, J.S.3
|