- Home
- » Tags
- » Ranked Pairs
Top View
- Communication Complexity of Common Voting Rules∗
- Weakly-Supervised Learning Approaches for Event Knowledge Acquisition and Event Detection
- Liberal Democrats
- J. Edwards, A. Bhat, S. Jordan, E. Mead, E. Minor, F. Musial, M
- Yellow Paper
- Scheduling Meets Computational Social Choice
- Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking
- The Price of Neutrality for the Ranked Pairs Method
- Control Complexity of Schulze Voting
- A Strategy and Honesty Based Comparison of Preferential Ballot Voting Methods
- Trends in Computational Social Choice
- Split Cycle: a New Condorcet Consistent Voting Method Independent of Clones and Immune to Spoilers
- Package 'Votesys'
- Computational Voting Theory
- Four Condorcet-Hare Hybrid Methods for Single-Winner Elections
- Single Transferable Vote: Incomplete Knowledge and Communication Issues
- Consistent Probabilistic Social Choice
- Voting Methods and Colluding Voters
- Realities Mar Instant Runoff Voting 18 Flaws and 4 Benefits June 10, 2008, Version #2– Updated Jun 25, Aug 3, Aug 7, 2008 & Feb 12, 2009 by Kathy Dopp, MS Mathematics
- Consistent Probabilistic Social Choice
- Personalisierung Der Verhältniswahl Durch Varianten Der Single Transferable Vote Vorschläge Zur Reform Des Berliner Wahlrechts Und Möglichkeiten, Sie Durchzusetzen
- Should I Stay Or Should I Go? the No-Show Paradox in Voting and Assignment
- A Complexity-Of-Strategic-Behavior Comparison Between Schulze's
- Tutorial: Computational P Voting Theory