Flexible level-1 consensus ensuring stable social choice: analysis and algorithms
暂无分享,去创建一个
[1] James Bennett,et al. The Netflix Prize , 2007 .
[2] Shmuel Nitzan,et al. Level r Consensus and Stable Social Choice , 2014 .
[3] Michel Regenwetter,et al. The impartial culture maximizes the probability of majority cycles , 2003, Soc. Choice Welf..
[4] Craig Boutilier,et al. Effective sampling and learning for mallows models with pairwise-preference data , 2014, J. Mach. Learn. Res..
[5] Ariel D. Procaccia,et al. Better Human Computation Through Principled Voting , 2013, AAAI.
[6] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .
[7] Jérôme Lang,et al. Single-peaked consistency and its complexity , 2008, ECAI.
[8] Nikolay L. Poliakov. Note on level r consensus , 2016, 1606.04816.
[9] John G. Kemeny,et al. Mathematical models in the social sciences , 1964 .
[10] Martin Lackner,et al. On the likelihood of single-peaked preferences , 2017, Soc. Choice Welf..
[11] LuTyler,et al. Effective sampling and learning for mallows models with pairwise-preference data , 2014 .
[12] John G. Kemeny,et al. Mathematical models in the social sciences , 1964 .
[13] Gerhard J. Woeginger,et al. A characterization of the single-crossing domain , 2013, Soc. Choice Welf..
[14] Edith Elkind,et al. Preference Restrictions in Computational Social Choice: Recent Progress , 2016, IJCAI.
[15] William V. Gehrlein,et al. The expected probability of Condorcet's paradox , 1981 .
[16] Salvador Barberà,et al. Top monotonicity: A common root for single peakedness, single crossing and the median voter result , 2011, Games Econ. Behav..
[17] Padhraic Smyth,et al. KDD Cup and workshop 2007 , 2007, SKDD.
[18] Timothy M. Chan,et al. Counting inversions, offline orthogonal range counting, and related problems , 2010, SODA '10.