Compiling the votes of a subelectorate
暂无分享,去创建一个
Yann Chevaleyre | Nicolas Maudet | Jérôme Lang | Guillaume Ravilly-Abadie | J. Lang | Y. Chevaleyre | N. Maudet | Guillaume Ravilly-Abadie
[1] Francesco M. Donini,et al. Preprocessing of Intractable Problems , 2002, Inf. Comput..
[2] Toby Walsh. Complexity of Terminating Preference Elicitation , 2008, AAMAS.
[3] Toby Walsh,et al. Incompleteness and Incomparability in Preference Aggregation , 2007, IJCAI.
[4] Vincent Conitzer,et al. Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders , 2008, AAAI.
[5] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[6] Vincent Conitzer,et al. Vote elicitation: complexity and strategy-proofness , 2002, AAAI/IAAI.
[7] Jérôme Lang,et al. Voting procedures with incomplete preferences , 2005 .
[8] Toby Walsh. Complexity Issues in Preference Elicitation and Manipulation , 2008, ISAIM.
[9] S. Brams,et al. The paradox of multiple elections , 1998 .
[10] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[11] Francesco M. Donini,et al. Feasibility and Unfeasibility of Off-Line Processing , 1996, ISTCS.
[12] Vincent Conitzer,et al. Communication complexity of common voting rules , 2005, EC '05.