Socialchoice

A collection of research papers, open sources on social choice theory or voting problem.

[Background]

• <a href="http://plato.stanford.edu/entries/social-choice/" target="_blank">Stanford Encyclopedia of Philosophy: Social Choice Theory</a>

• <a href="https://electology.org/library" target="_blank">Voting Methods</a>

• <a href="http://zesty.ca/voting/sim/" target="_blank">Voting Simulation Visualizations</a>

[Courses & Conferences]

• [Conference] <a href="http://research.illc.uva.nl/COMSOC/workshops.html" target="_blank">International Workshop on Computational Social Choice</a>
• [Conference] <a href="http://dblp.uni-trier.de/db/conf/re/revote2009.html" target="_blank">DBLP: REVOTE 2009</a>
• [PHD Theses] <a href="https://www.illc.uva.nl/COMSOC/theses.html" target="_blank">Computational Social Choice</a>
• [Book] <a href="http://procaccia.info/papers/comsoc.pdf" target="_blank">Handbook of Computational Social Choice</a>
• [Book] <a href="http://www.springer.com/us/book/9780387776439">Mathematics and Politics: Strategy, Voting, Power, and Proof</a>
• [Course] <a href="https://staff.fnwi.uva.nl/u.endriss/teaching/comsoc/2011/" target="_blank">Computational Social Choice</a>
• [Course] <a href="https://www.coursetalk.com/providers/coursera/courses/making-better-group-decisions-voting-judgement-aggregation-and-fair-division" target="_blank">Making Better Group Decisions Voting, Judgement Aggregation and Fair Division</a>
• [Course] <a href="http://www.ma.huji.ac.il/~kalai/course07.html" target="_blank">Social Choice Theory</a>
• [Course] <a href="https://www.cs.duke.edu/courses/spring15/compsci290.4/" target="_blank">Crowdsourcing Societal Tradeoffs</a>

[Open Source]

• <a href="https://github.com/PrefPy/prefpy" target="_blank">PrefPy</a> and <a href="https://opra.cs.rpi.edu/polls/main" target="_blank"> OPRA: Online Preference Reporting and Aggregation</a> Supported by <a href="http://www.cs.rpi.edu/~xial/" target="_blank">Lirong Xia's Group</a>

• <a href="http://svvamp.readthedocs.io/en/latest/reference.html" target="_blank">SVVAMP: Simulator of Various Voting Algorithms in Manipulating Populations</a>

• <a href="http://ballotbox.sourceforge.net/#invborda" target="_blank">BallotBox: Java library of social choice rules</a>

  • 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

• <a href="https://www.mathworks.com/matlabcentral/fileexchange/28521-election/content/election.m?requestedDomain=www.mathworks.com" target="_blank">Matlab implementation of winner determination algorithms</a>

  • 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

• <a href="http://bolson.org/voting/vote_util/" target="_blank">Brian's Voting Utilities</a>

• <a href="https://github.com/morinokami/social_choice" target="_blank">Python: Plurality, Runoff, Elimination Method, Borda Count, and Condorcet</a>

• <a href="https://github.com/Conservatory/openstv" target="_blank">OpenSTV: Single Transferable Vote (a.k.a STV)</a>

• <a href="https://github.com/matsu7874/social-choice/blob/master/election.cc" target="_blank">C++: Pairwise Comparison, Borda Count, Plurality and Schulze</a>

• <a href="https://github.com/JohnDickerson/VotingRules" target="_blank">Java: Dodgson Scoring</a>

• <a href="https://github.com/WarrenGM/VotingSystems" target="_blank">Java: First Past the Post, Instant Runoff Voting, Borda count, and Condorcet methods</a>

• <a href="http://rubyvote.rubyforge.org/" target="_blank">Ruby: Plurality, Approval, Borda, Condorcet (w/ Cloneproof SSD), Instant Runnoff Voting</a> | By <a href="https://mako.cc/" target="_blank">Benjamin Mako Hill</a>

• <a href="https://github.com/julien-boudry/Condorcet" target="_blank">PHP: Condorcet methods (Schulze or Copeland)</a>

• <a href="https://github.com/dpaukov/combinatoricslib3" target="_blank">Java 8 Combinatoricslib3: Permutations and Combinations</a>

• <a href="http://datafu.incubator.apache.org/docs/datafu/1.2.0/datafu/pig/sampling/SimpleRandomSampleWithReplacementVote.html" target="_blank">SimpleRandomSampleWithReplacementVote (DataFu 1.2.0)</a>

• <a href="https://github.com/benadida/helios-server/" target="_blank">Helios: An end-to-end verifiable voting system</a>

[Research Papers]

• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/1995%20-%20Axiomatic%20derivation%20of%20scoring%20rules%20without%20the%20ordering%20assumption%20-%20Myerson.pdf" target="_blank">Axiomatic derivation of scoring rules without the ordering assumption</a>, 1995, by Myerson
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/1995%20-%20Conventional%20Machine%20Learning%20for%20Social%20Choice%20-%20Doucette,%20Larson,%20Cohen.pdf" target="_blank">Conventional Machine Learning for Social Choice</a>, 1995, by Doucette, Larson, Cohen
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2001%20-%20A%20Statistical%20Investigation%20of%20Social%20Choice%20Functions%20-%20Slinko,%20Leung.pdf" target="_blank">A Statistical Investigation of Social Choice Functions</a>, 2001, by Slinko, Leung
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2001%20-%20Mathematics%20and%20Democracy%20-%20The%20Case%20for%20Quantitative%20Literacy%20-%20Nygaard.pdf" target="_blank">Mathematics and Democracy - The Case for Quantitative Literacy</a>, 2001, by Nygaard
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2002%20-%20Condorcet's%20paradox%20and%20the%20likelihood%20of%20its%20occurrence%20Different%20perspectives%20on%20balanced%20preferences%20-%20Gehrlein.pdf" target="_blank">Condorcet's paradox and the likelihood of its occurrence Different perspectives on balanced preferences</a>, 2002, by Gehrlein
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2004%20-%20A%20Decomposition%20of%20Voting%20Profile%20Spaces%20-%20Clifford.pdf" target="_blank">A Decomposition of Voting Profile Spaces</a>, 2004, by Clifford
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2004%20-%20If%20you%20like%20the%20alternative%20vote%20(a.k.a.%20the%20instant%20runoff),%20then%20you%20ought%20to%20know%20about%20the%20Coombs%20rule%20-%20Grofman,%20Feld.pdf" target="_blank">If you like the alternative vote (a.k.a. the instant runoff), then you ought to know about the Coombs rule</a>, 2004, by Grofman, Feld
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2005%20-%20Voting%20Systems%20-%20Johnson.pdf" target="_blank">Voting Systems</a>, 2005, by Johnson
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2006%20-%20Necessary%20and%20Sufficient%20conditions%20for%20a%20majority%20winner%20in%20n-dimensional%20spatial%20voting%20games%20-%20an%20intuitive%20geometric%20approach.pdf" target="_blank">Necessary and Sufficient conditions for a majority winner in n-dimensional spatial voting games</a>, 2006, by an intuitive geometric approach
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2006%20-%20Neural%20voting%20machines%20-%20Richards,%20Sebastian%20Seung,%20Pickard.pdf" target="_blank">Neural voting machines</a>, 2006, by Richards, Sebastian Seung, Pickard
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2007%20-%20A%20Short%20Introduction%20to%20Computational%20Social%20Choice%20-%20Chevaleyre%20et%20al.pdf" target="_blank">A Short Introduction to Computational Social Choice</a>, 2007, by Chevaleyre et al
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2007%20-%20Size%20Approval%20Voting%20-%20Alcalde-Unzu,%20Vorsatz.pdf" target="_blank">Size Approval Voting - Alcalde</a>, 2007, by Unzu, Vorsatz
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2008%20-%20A%20fast%20algorithm%20for%20learning%20a%20ranking%20function%20from%20large-scale%20data%20sets%20-%20Raykar,%20Duraiswami,%20Krishnapuram.pdf" target="_blank">A fast algorithm for learning a ranking function from large-scale data sets</a>, 2008, by Raykar, Duraiswami, Krishnapuram
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2008%20-%20GEOMETRY%20OF%20VOTING%20-%20Saari.pdf" target="_blank">GEOMETRY OF VOTING</a>, 2008, by Saari
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2008%20-%20Generalized%20scoring%20rules%20and%20the%20frequency%20of%20coalitional%20manipulability%20-%20Xia,%20Conitzer.pdf" target="_blank">Generalized scoring rules and the frequency of coalitional manipulability</a>, 2008, by Xia, Conitzer
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2008%20-%20Mathematics%20and%20Democracy-%20Designing%20Better%20Voting%20and%20Fair-Division%20Procedures%20-%20Brams.pdf" target="_blank">Mathematics and Democracy- Designing Better Voting and Fair-Division Procedures</a>, 2008, by Brams
• <a href="http://github.com/horsehour/socialchoice/blob/master/Paper/2008%20-%20Mathematics%20and%20Politics%20-%20Strategy,%20Voting,%20Power%20and%20Proof%20-%20Taylor,%20Pacelli.pdf" target="_blank">Mathematics and Politics - Strategy, Voting, Power and Proo