An Efficient Majority-Rule-Based Approach for Collective Decision Making with CP-Nets
暂无分享,去创建一个
[1] Lirong Xia,et al. Strongly Decomposable Voting Rules on Multiattribute Domains , 2007, AAAI.
[2] Yann Chevaleyre,et al. Preference Handling in Combinatorial Domains: From AI to Social Choice , 2008, AI Mag..
[3] Ronen I. Brafman,et al. CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..
[4] Miroslaw Truszczynski,et al. The computational complexity of dominance and consistency in CP-nets , 2005, IJCAI.
[5] Toby Walsh,et al. mCP Nets: Representing and Reasoning with Preferences of Multiple Agents , 2004, AAAI.
[6] Vincent Conitzer,et al. Voting on Multiattribute Domains with Cyclic Preferential Dependencies , 2008, AAAI.
[7] Lirong Xia,et al. Sequential composition of voting rules in multi-issue domains , 2009, Math. Soc. Sci..
[8] Ronen I. Brafman,et al. Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.