A Maximum Likelihood Approach For Selecting Sets of Alternatives
暂无分享,去创建一个
[1] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .
[2] H. Young. Condorcet's Theory of Voting , 1988, American Political Science Review.
[3] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[4] Moni Naor,et al. Rank aggregation methods for the Web , 2001, WWW '01.
[5] M. Charikar,et al. Aggregating inconsistent information: ranking and clustering , 2005, STOC '05.
[6] Vincent Conitzer,et al. Common Voting Rules as Maximum Likelihood Estimators , 2005, UAI.
[7] Noga Alon,et al. Ranking Tournaments , 2006, SIAM J. Discret. Math..
[8] Vincent Conitzer,et al. Improved Bounds for Computing Kemeny Rankings , 2006, AAAI.
[9] Anders Yeo,et al. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.
[10] Mark Braverman,et al. Noisy sorting without resampling , 2007, SODA '08.
[11] Vincent Conitzer,et al. Generalized scoring rules and the frequency of coalitional manipulability , 2008, EC '08.
[12] Lirong Xia,et al. On a generalization of triangulated graphs for domains decomposition of CSPs , 2009, IJCAI.
[13] Nicolas de Condorcet. Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .
[14] Vincent Conitzer,et al. Aggregating preferences in multi-issue domains by using maximum likelihood estimators , 2010, AAMAS.
[15] Adrien Treuille,et al. Predicting protein structures with a multiplayer online game , 2010, Nature.
[16] Craig Boutilier,et al. Learning Mallows Models with Pairwise Preferences , 2011, ICML.
[17] Vincent Conitzer,et al. A Maximum Likelihood Approach towards Aggregating Partial Orders , 2011, IJCAI.