Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains
暂无分享,去创建一个
[1] W. Burnside,et al. Theory of equations , 1886 .
[2] C. L. Mallows. NON-NULL RANKING MODELS. I , 1957 .
[3] T. A. Brown,et al. Theory of Equations. , 1950, The Mathematical Gazette.
[4] K. Mahler. An inequality for the discriminant of a polynomial. , 1964 .
[5] Alkiviadis G. Akritas,et al. Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.
[6] H. Young. Condorcet's Theory of Voting , 1988, American Political Science Review.
[7] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[8] B. Grofman,et al. A Unified Theory of Voting: Directional and Proximity Spatial Models , 1999 .
[9] Thomas C. Ratliff. A comparison of Dodgson's method and Kemeny's rule , 2001, Soc. Choice Welf..
[10] John D. Lafferty,et al. Cranking: Combining Rankings Using Conditional Probability Models on Permutations , 2002, ICML.
[11] M. Charikar,et al. Aggregating inconsistent information: ranking and clustering , 2005, STOC '05.
[12] Vincent Conitzer,et al. Common Voting Rules as Maximum Likelihood Estimators , 2005, UAI.
[13] Atri Rudra,et al. Ordering by weighted number of wins gives a good ranking for weighted tournaments , 2006, SODA '06.
[14] Vincent Conitzer,et al. Improved Bounds for Computing Kemeny Rankings , 2006, AAAI.
[15] T. Tideman,et al. Collective Decisions and Voting: The Potential for Public Choice , 2006 .
[16] Claire Mathieu,et al. Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .
[17] Jeff A. Bilmes,et al. Consensus ranking under the exponential model , 2007, UAI.
[18] Luis von Ahn. Human Computation , 2008, ICDE.
[19] David P. Williamson,et al. Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems , 2007, WAOA.
[20] Lirong Xia,et al. On a generalization of triangulated graphs for domains decomposition of CSPs , 2009, IJCAI.
[21] Nicolas de Condorcet. Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .
[22] M. Mignotte,et al. POLYNOMIAL ROOT SEPARATION , 2010 .
[23] Vincent Conitzer,et al. Aggregating preferences in multi-issue domains by using maximum likelihood estimators , 2010, AAMAS.
[24] Ariel D. Procaccia,et al. Socially desirable approximations for Dodgson's voting rule , 2010, EC.
[25] Craig Boutilier,et al. Learning Mallows Models with Pairwise Preferences , 2011, ICML.
[26] Edith Law,et al. Human Computation , 2011, Human Computation.
[27] Vincent Conitzer,et al. A Maximum Likelihood Approach towards Aggregating Partial Orders , 2011, IJCAI.
[28] Ariel D. Procaccia,et al. A Maximum Likelihood Approach For Selecting Sets of Alternatives , 2012, UAI.
[29] Ariel D. Procaccia,et al. When do noisy votes reveal the truth? , 2013, EC '13.
[30] Ariel D. Procaccia,et al. Better Human Computation Through Principled Voting , 2013, AAAI.
[31] David C. Parkes,et al. A Statistical Decision-Theoretic Framework for Social Choice , 2014, NIPS.