Voting Rules from Random Relations
暂无分享,去创建一个
[1] T. Tideman,et al. Collective Decisions and Voting: The Potential for Public Choice , 2006 .
[2] Peter C. Fishburn,et al. Monotonicity paradoxes in the theory of elections , 1982, Discret. Appl. Math..
[3] H. Young. Extending Condorcet's rule , 1977 .
[4] Felix Brandt,et al. Rolling the Dice : Recent Results in Probabilistic Social Choice , 2017 .
[5] Meir Kalech,et al. Practical voting rules with partial information , 2010, Autonomous Agents and Multi-Agent Systems.
[6] S. Shapiro,et al. Mathematics without Numbers , 1993 .
[7] Felix Brandt,et al. Tournament Solutions , 2016, Handbook of Computational Social Choice.
[8] Vincent Conitzer. Comparing multiagent systems research in combinatorial auctions and voting , 2010, Annals of Mathematics and Artificial Intelligence.
[9] Edith Hemaspaandra,et al. Dodgson's Rule and Young's Rule , 2016, Handbook of Computational Social Choice.
[10] Edith Elkind,et al. Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains , 2014, UAI.
[11] Edith Elkind,et al. Rationalizations of Voting Rules , 2016, Handbook of Computational Social Choice.
[12] Piotr Faliszewski,et al. Good Rationalizations of Voting Rules , 2010, AAAI.
[13] Piotr Faliszewski,et al. Distance rationalization of voting rules , 2015, Soc. Choice Welf..
[14] Vincent Conitzer,et al. Common Voting Rules as Maximum Likelihood Estimators , 2005, UAI.
[15] Irène Charon,et al. An updated survey on the linear ordering problem for weighted or unweighted tournaments , 2010, Ann. Oper. Res..
[16] Nic Wilson. Generating Voting Rules from Random Relations , 2019, AAMAS.
[17] Rolf Niedermeier,et al. Weighted Tournament Solutions , 2016, Handbook of Computational Social Choice.
[18] Christian Klamler,et al. Distance-Based Aggregation Theory , 2011, Consensual Processes.
[19] P. Fishburn. Condorcet Social Choice Functions , 1977 .
[20] Alexander Artikis,et al. Voting in Multi-Agent Systems , 2006, Comput. J..
[21] Barbara Messing,et al. An Introduction to MultiAgent Systems , 2002, Künstliche Intell..
[22] T. Tideman,et al. Independence of clones as a criterion for voting rules , 1987 .
[23] William S. Zwicker,et al. Introduction to the Theory of Voting , 2016, Handbook of Computational Social Choice.
[24] Olivier Hudry,et al. NP-hardness results for the aggregation of linear orders into median orders , 2008, Ann. Oper. Res..
[25] William S. Zwicker,et al. Monotonicity properties and their adaptation to irresolute social choice rules , 2012, Soc. Choice Welf..