TypeScript library implementing various Condorcet voting algorithms
A simple condorcet vote algorithm implementation in typescript
No description provided.
Quorum — Multi-AI deliberation framework — diverge, challenge, converge.
implementation of voting algorithms
No description provided.
Social choice algorithms and voting rules
Rank fusion algorithms for hybrid search — RRF, ISR, CombMNZ, Borda, DBSF. Zero dependencies.
No description provided.
Playing around with Voting Systems
A voting profile for a fair voting system
Implementation of some [electoral systems](https://en.wikipedia.org/wiki/Electoral_system)
Ranked pairs voting (Tideman) with a fixed four-level deterministic tiebreaker cascade: margin, winning votes, beatpath, lexicographic.
Run a spatial election model. Input geometry. Cast votes. Use a social choice function. Collect results. Also combine multiple elections across geography, districts, samplings, and polling.
Rick Osborne's collection of voting-related utilities
A DAO DAO proposal module with ranked-choice, Condorcet voting.
Collection of preferential voting methods
Sangha — sociology engine for social networks, game theory, and group dynamics
Operations on ranked lists: fusion (RRF, Copeland, CombMNZ, DBSF, 14 methods), reranking (MaxSim/ColBERT, MMR, DPP), evaluation (NDCG, MAP, MRR), diagnostics, pipeline builder.
tallystick is a rust library for talling votes
Ranked Choice Voting implementation using Tries in Rust
This gem is a Ruby implementation of the Schulze voting method (using Floyd–Warshall algorithm), a type of the Condorcet voting methods.
This gem is a Ruby implementation of the Schulze voting method (with help of the Floyd-Warshall algorithm), a type of the Condorcet voting methods.
Schulze (Condorcet) voting calculation.
The Schulze Method, for ruby