Average-case tractability of manipulation in voting via the fraction of manipulators
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Complexity of manipulating elections with few candidates , 2002, AAAI/IAAI.
[2] Sandip Sen,et al. An automated meeting scheduling system that utilizes user preferences , 1997, AGENTS '97.
[3] Vincent Conitzer,et al. Nonexistence of Voting Rules That Are Usually Hard to Manipulate , 2006, AAAI.
[4] Inon Zuckerman,et al. Universal Voting Protocol Tweaks to Make Manipulation Hard , 2003, IJCAI.
[5] Arkadii M. Slinko,et al. How large should a coalition be to manipulate an election? , 2004, Math. Soc. Sci..
[6] M. Trick,et al. The computational difficulty of manipulating an election , 1989 .
[7] Sandip Sen,et al. Voting for movies: the anatomy of a recommender system , 1999, AGENTS '99.
[8] Ariel D. Procaccia,et al. Junta Distributions and the Average-Case Complexity of Manipulating Elections , 2007, J. Artif. Intell. Res..
[9] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .
[10] Vincent Conitzer,et al. How many candidates are needed to make elections hard to manipulate? , 2003, TARK '03.
[11] John J. Bartholdi,et al. Single transferable vote resists strategic voting , 2015 .
[12] Z. Neeman,et al. The asymptotic strategyproofness of scoring and Condorcet consistent rules , 2002 .
[13] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[14] Osamu Watanabe,et al. Instance complexity , 1994, JACM.