Hybrid Voting Protocols and Hardness of Manipulation
暂无分享,去创建一个
[1] M. Satterthwaite. The Existence of a Strategy Proof Voting Procedure , 1973 .
[2] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .
[3] P. Strevens. Iii , 1985 .
[4] M. Trick,et al. The computational difficulty of manipulating an election , 1989 .
[5] John J. Bartholdi,et al. Single transferable vote resists strategic voting , 2015 .
[6] Eithan Ephrati,et al. Multi-Agent Planning as a Dynamic Search for Social Consensus , 1993, IJCAI.
[7] Eric Horvitz,et al. Social Choice Theory and Recommender Systems: Analysis of the Axiomatic Foundations of Collaborative Filtering , 2000, AAAI/IAAI.
[8] Moni Naor,et al. Rank aggregation methods for the Web , 2001, WWW '01.
[9] Vincent Conitzer,et al. Complexity of manipulating elections with few candidates , 2002, AAAI/IAAI.
[10] Inon Zuckerman,et al. Universal Voting Protocol Tweaks to Make Manipulation Hard , 2003, IJCAI.
[11] Ronald Fagin,et al. Comparing and aggregating rankings with ties , 2004, PODS '04.
[12] Edith Elkind,et al. Small Coalitions Cannot Manipulate Voting , 2005, Financial Cryptography.