Computational Social Choice
A collection of research papers, open sources on social choice theory.
[Background]
- Stanford Encyclopedia of Philosophy: Social Choice Theory
- Voting Methods
- Voting Simulation Visualizations
[Courses & Conferences]
- [Conference] International Workshop on Computational Social Choice
- [Conference] DBLP: REVOTE 2009
- [PHD Theses] Computational Social Choice
- [Book] Handbook of Computational Social Choice
- [Book] Mathematics and Politics: Strategy, Voting, Power, and Proof
- [Course] Computational Social Choice
- [Course] Making Better Group Decisions Voting, Judgement Aggregation and Fair Division
- [Course] Social Choice Theory
- [Course] Crowdsourcing Societal Tradeoffs
[Open Source]
-
PrefPy and OPRA: Online Preference Reporting and Aggregation Supported by Lirong Xia’s Group
-
SVVAMP: Simulator of Various Voting Algorithms in Manipulating Populations
-
BallotBox: Java library of social choice rules
-
Scoring Rules: Plurality Vote, Approval Voting, Run-Off Vote, Hare’s Procedure, Inverse Plurality Vote, Borda’s Rule, Sum Vote, Inverse Borda Rule, Coomb’s Procedure, Nanson’s Procedure
-
Rules Using Majority Relation: Condorcet Vote, Fishburn’s Rule, Uncovered Set I, Uncovered Set II, Richelson Rule
-
Rules Using Value Function: Copeland’s Rule Net, Copeland’s Rule Out, Copeland’s Rule In
-
Rules Using Tournament Matrix: Maxmin Procedure, Minmax Procedure
-
q-Paretian Rules: Strong q-Paretian Simple Majority Rule, Strong q-Paretian Plurality Rule, Strongest q-Paretian Simple Majority Rule
-
-
Matlab implementation of winner determination algorithms
-
Primary votes: Dictator, Random (Hat), First Past the Post (FPP), Runoff
-
non-Condorcet Preferential: Single Transferable Vote (STV or Instant Runoff, Alternative Vote), Coombs, Borda (Nanson, Baldwin), Bucklin
-
Condorcet: Copeland, Kemeny-Young, RankedPairs, Schulze, Smith, Schwartz, Landau (a.k.a Uncovered set or Fishburn set), Minimax vote, Minimax Margin
-
- Brian's Voting Utilities
- Python: Plurality, Runoff, Elimination Method, Borda Count, and Condorcet
- OpenSTV: Single Transferable Vote (a.k.a STV)
- C++: Pairwise Comparison, Borda Count, Plurality and Schulze
- Java: Dodgson Scoring
- Java: First Past the Post, Instant Runoff Voting, Borda count, and Condorcet methods
-
Ruby: Plurality, Approval, Borda, Condorcet (w/ Cloneproof SSD), Instant Runnoff Voting By Benjamin Mako Hill - PHP: Condorcet methods (Schulze or Copeland)
- Java 8 Combinatoricslib3: Permutations and Combinations
- SimpleRandomSampleWithReplacementVote (DataFu 1.2.0)
- Helios: An end-to-end verifiable voting system
[Research Papers]
- Axiomatic derivation of scoring rules without the ordering assumption, 1995, by Myerson
- Conventional Machine Learning for Social Choice, 1995, by Doucette, Larson, Cohen
- A Statistical Investigation of Social Choice Functions, 2001, by Slinko, Leung
- Mathematics and Democracy - The Case for Quantitative Literacy, 2001, by Nygaard
- Condorcet’s paradox and the likelihood of its occurrence Different perspectives on balanced preferences, 2002, by Gehrlein
- A Decomposition of Voting Profile Spaces, 2004, by Clifford
- If you like the alternative vote (a.k.a. the instant runoff), then you ought to know about the Coombs rule, 2004, by Grofman, Feld
- Voting Systems, 2005, by Johnson
- Necessary and Sufficient conditions for a majority winner in n-dimensional spatial voting games, 2006, by an intuitive geometric approach
- Neural voting machines, 2006, by Richards, Sebastian Seung, Pickard
- A Short Introduction to Computational Social Choice, 2007, by Chevaleyre et al
- Size Approval Voting - Alcalde, 2007, by Unzu, Vorsatz
- A fast algorithm for learning a ranking function from large-scale data sets, 2008, by Raykar, Duraiswami, Krishnapuram
- GEOMETRY OF VOTING, 2008, by Saari
- Generalized scoring rules and the frequency of coalitional manipulability, 2008, by Xia, Conitzer
- Mathematics and Democracy- Designing Better Voting and Fair-Division Procedures, 2008, by Brams
- Mathematics and Politics - Strategy, Voting, Power and Proof, 2008, by Taylor, Pacelli
- Two New Measurements of Voting Power, 2008, by Pennock
- A Framework for the Quantitative Evaluation of Voting Rules, 2009, by Munie, Tang, Shoham
- Computer-aided proofs of Arrow’s and other impossibility theorems, 2009, by Tang, Lin
- Finite local consistency characterizes generalized scoring rules, 2009, by Xia, Conitzer
- Learning Generalized Scoring Rules, 2009, by Haghtalab
- Preference functions that score rankings and maximum likelihood estimation, 2009, by Conitzer, Rognlie, Xia
- The learnability of voting rules, 2009, by Procaccia et al
- INFORMATION RETRIEVAL Implementing and Evaluating Search Engines, 2010, by Buttcher
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method, 2011, by Schulze
- Computational Voting Theory Computational Voting Theory Game-Theoretic and Combinatorial Aspects, 2011, by Xia
- How to Analyze Paired Comparison Data, 2011, by Tsukida, Gupta
- THE LIKELIHOOD OF CHOOSING THE BORDA-WINNER WITH PARTIAL PREFERENCE RANKINGS OF THE, 2011, by Giritligil
- Random utility theory for social choice, 2012, by Soufiani, Parkes, Xia
- Social Choice for Human Computation, 2012, by Mao, Procaccia, Chen
- The Price of Neutrality for the Ranked Pairs Method., 2012, by Brill, Fischer
- A smooth transition from powerlessness to absolute power, 2013, by Mossel, Procaccia, Racz
- Algorithms, Games, and Networks, 2013, by Procaccia
- Designing social choice mechanisms using machine learning, 2013, by Xia
- Generalized Method-of-Moments for Rank Aggregation, 2013, by Soufiani et al
- Generalized scoring rules a framework that reconciles Borda and Condorcet, 2013, by Xia
- Preference Elicitation For General Random Utility Models, 2013, by Soufiani, Parkes, Xia
- Scientific Data Ranking Methods - Theory and Applications, 2013, by Tobergte, Curtis
- The Impartial, Anonymous, and Neutral Culture Model A Probability Model for Sampling Public Preference Structures, 2013, by Egecioglu,
- A Survey of Axiom Selection as a Machine Learning Problem, 2014, by Kuhlwein, Blanchette
- Bayesian nonparametric Plackett-Luce models for the analysis of preferences for college degree programmes, 2014, by Caron, Teh, Murphy
- Chaotic Elections Constructing and decomposing an election profile using various voting procedures, 2014, by Lee
- Clusters, Orders, and Trees Methods and Applications, 2014, by Goldengorin, Honor
- Computing Parametric Ranking Models via Rank-Breaking, 2014, by Soufiani, Parkes, Xia
- Formal Verification of Voting Schemes, 2014, by Kirsten
- Measuring diversity of preferences in a group, 2014, by Hashemi, Endriss
- Statistical Properties of Social Choice Mechanisms, 2014, by Xia
- Voting with Rank Dependent Scoring Rules, 2014, by Goldsmith et al
- A Deep Exploration of the Complexity Border of Strategic Voting Problems, 2015, by Yang
- Automatic Design of Decision-Tree Induction Algorithms, 2015, by Barros, Freitas
- Computational Social Science Toward a Collaborative Future, 2015, by Wallach
- Deep neural decision forests, 2015, by Kontschieder et al
- Efficient Dodgson-Score Calculation Using Heuristics and Parallel Computing, 2015, by Recknagel, Besold
- Fast and Accurate Inference of Plackett Luce Models, 2015, by Maystre, Grossglauser
- Generalized Decision Scoring Rules Statistical , Computational , and Axiomatic Properties, 2015, by Xia
- Sample Complexity for Winner Prediction in Elections, 2015, by Dey
- CP-nets From Theory to Practice, 2016, by Allen
- Handbook of Computational Social Choice, 2016, by Brandt, Conitzer, Endriss
- Learning Mixtures of Plackett-Luce models, 2016, by Zhao, Piech, Xia
- PREFERENCES OPTIMIZATION, IMPORTANCE LEARNING AND, 2016, by Zhu
- Proceedings of the 3 Workshop on Exploring Beyond the Worst Case In Computational Social Choice ( EXPLORE 2016 ) Held as part of, 2016
- Statistical evaluation of voting rules, 2016, by Green-Armytage, Tideman, Cosman
- Voting rules as error-correcting codes, 2016, by Procaccia, Shah, Zick