Junta Distributions and the Average-Case Complexity of Manipulating Elections
暂无分享,去创建一个
[1] Inon Zuckerman,et al. Universal Voting Protocol Tweaks to Make Manipulation Hard , 2003, IJCAI.
[2] Vincent Conitzer,et al. Complexity of manipulating elections with few candidates , 2002, AAAI/IAAI.
[3] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[4] Edith Elkind,et al. Small Coalitions Cannot Manipulate Voting , 2005, Financial Cryptography.
[5] Eithan Ephrati,et al. A heuristic technique for multi‐agent planning , 1997, Annals of Mathematics and Artificial Intelligence.
[6] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[7] Sandip Sen,et al. Voting for movies: the anatomy of a recommender system , 1999, AGENTS '99.
[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[9] M. Trick,et al. The computational difficulty of manipulating an election , 1989 .
[10] Edith Hemaspaandra,et al. Dichotomy for voting systems , 2005, J. Comput. Syst. Sci..
[11] Edith Elkind,et al. Hybrid Voting Protocols and Hardness of Manipulation , 2005, ISAAC.
[12] Sandip Sen,et al. An automated meeting scheduling system that utilizes user preferences , 1997, AGENTS '97.
[13] Ariel D. Procaccia,et al. Multi-Winner Elections: Complexity of Manipulation, Control and Winner-Determination , 2007, IJCAI.
[14] Vincent Conitzer,et al. How many candidates are needed to make elections hard to manipulate? , 2003, TARK '03.
[15] John J. Bartholdi,et al. Single transferable vote resists strategic voting , 2015 .
[16] Michael A. Trick,et al. How hard is it to control an election? Math , 1992 .
[17] Jeffrey S. Rosenschein,et al. Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents , 2005, IJCAI.
[18] Vincent Conitzer,et al. Nonexistence of Voting Rules That Are Usually Hard to Manipulate , 2006, AAAI.
[19] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .