暂无分享,去创建一个
[1] H. Moulin. Choosing from a tournament , 1986 .
[2] Ariel D. Procaccia,et al. The Distortion of Cardinal Preferences in Voting , 2006, CIA.
[3] Yu Cheng,et al. On the Distortion of Voting with Multiple Representative Candidates , 2017, AAAI.
[4] Nicolas de Condorcet. Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .
[5] Nikhil R. Devanur,et al. A Duality-Based Unified Approach to Bayesian Mechanism Design , 2019, SIAM J. Comput..
[6] A. Gibbard. Manipulation of Voting Schemes: A General Result , 1973 .
[7] M. Satterthwaite. Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .
[8] Amos Fiat,et al. On Voting and Facility Location , 2015, EC.
[9] Faruk Gul,et al. Generalized Median Voter Schemes and Committees , 1993 .
[10] G. Thompson,et al. The Theory of Committees and Elections. , 1959 .
[11] Craig Boutilier,et al. Incomplete Information and Communication in Voting , 2016, Handbook of Computational Social Choice.
[12] Ariel D. Procaccia. Can Approximation Circumvent Gibbard-Satterthwaite? , 2010, AAAI.
[13] Salvador Barberà,et al. An introduction to strategy-proof social choice functions , 2001, Soc. Choice Welf..
[14] Yu Cheng,et al. Of the People: Voting Is More Effective with Representative Candidates , 2017, EC.
[15] T. Tideman,et al. Independence of clones as a criterion for voting rules , 1987 .
[16] D. Black. On the Rationale of Group Decision-making , 1948, Journal of Political Economy.
[17] Craig Boutilier,et al. Optimal social choice functions: A utilitarian view , 2015, Artif. Intell..
[18] Elliot Anshelevich,et al. Randomized Social Choice Functions under Metric Preferences , 2015, IJCAI.
[19] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[20] Vincent Conitzer,et al. Handbook of Computational Social Choice , 2016 .
[21] B. Grofman,et al. A Unified Theory of Voting: Directional and Proximity Spatial Models , 1999 .
[22] H. Moulin. On strategy-proofness and single peakedness , 1980 .
[23] David Kempe,et al. Communication, Distortion, and Randomness in Metric Voting , 2019, AAAI.
[24] A. Downs. An Economic Theory of Political Action in a Democracy , 1957, Journal of Political Economy.
[25] Kamesh Munagala,et al. Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties , 2016, EC.
[26] Mark A. Schulze,et al. A New Monotonic and Clone-Independent Single-Winner Election Method , 2003 .
[27] Elliot Anshelevich,et al. Approximating Optimal Social Choice under Metric Preferences , 2015, AAAI.
[28] Elliot Anshelevich,et al. Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity , 2017, AAAI.
[29] Kamesh Munagala,et al. Improved Metric Distortion for Deterministic Social Choice Rules , 2019, EC.
[30] Ariel D. Procaccia,et al. Voting almost maximizes social welfare despite limited communication , 2010, Artif. Intell..
[31] Elliot Anshelevich,et al. Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information , 2016, AAAI.
[32] Elliot Anshelevich,et al. Ordinal approximation in matching and social choice , 2016, SECO.