Skip to main content

Functionality to optimize different classes of voting rules for user-defined goals.

Project description

Optimal Voting Package

This package allows the application of standard optimization techniques to voting rule design. Existing approaches of using neural networks to develop optimized voting rules have been critiqued due to their lack of interpretability. This package allows optimizing interpretable classes of voting rule such as positional scoring rules where simply looking at the score vector provides intuition about the rule itself.

The package aims to support a wide range of existing and user-specifiable optimization targets, as well as several classes of voting rule.

Possible optimization targets:

Optimizable rule types:

  • positional scoring rules (current)
  • probabilistic positional scoring rules (soon)
  • functions of (weighted) tournaments, i.e., C2 rules (soon)
  • sequential rules, i.e., Instant-Runoff Voting (soon)
  • sequential Thiele rules (eventual)
  • Thiele rules (perhaps)

Optimization techniques:

  • simulated annealing: due to ease-of-use across domains this is intended to be the primary optimization method
  • gradient descent: partially implemented at the moment. Early experiments show that this results in outcomes of a similar quality to simulated annealing but requires more compute. The eventual goal is to support GD with Torch and Jax but annealing is likely to remain preferable.

Proper documentation will be developed as the package matures. A rough overview of package use is:

  1. Generate preference profile(s) empirically or by sampling one or more distributions.
  2. (Optional) generate utilities corresponding to the preference profiles.
  3. Select an optimization target (i.e., egalitarian social welfare).
  4. Send profiles, utilities, target to Optimal-Voting.
  5. Optimal-Voting returns a positional scoring vector which maximizes egalitarian social welfare on the provided profiles.

NOTE: At the moment, the package is in active development. Changes that break compatibilty should be expected.

If you are interested in using the package or have suggestions for possible features you are encouraged to reach out at BenArmstrong dot ca

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

optimal_voting-0.0.3.tar.gz (21.5 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

optimal_voting-0.0.3-py3-none-any.whl (23.1 kB view details)

Uploaded Python 3

File details

Details for the file optimal_voting-0.0.3.tar.gz.

File metadata

  • Download URL: optimal_voting-0.0.3.tar.gz
  • Upload date:
  • Size: 21.5 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.11.6

File hashes

Hashes for optimal_voting-0.0.3.tar.gz
Algorithm Hash digest
SHA256 feb6e861406a67999986694b46ccdf4c085e63ca157e3c6b4a502f4246aebd83
MD5 a4ab4592c243feaab003f33bbdbb400b
BLAKE2b-256 cb65c21d0993e6b713287506a517f8167f9fc1715bfd058b12ce80d75dd0f8bd

See more details on using hashes here.

File details

Details for the file optimal_voting-0.0.3-py3-none-any.whl.

File metadata

  • Download URL: optimal_voting-0.0.3-py3-none-any.whl
  • Upload date:
  • Size: 23.1 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.11.6

File hashes

Hashes for optimal_voting-0.0.3-py3-none-any.whl
Algorithm Hash digest
SHA256 eb8a8118be401f09e70dfc6972a7013104cd0df5cc8f331955c32a734487f4d6
MD5 11b98b9692dc6c38a82c2ee1edf26f51
BLAKE2b-256 12bc87c91ec84c044f7bccf66641bf85d28d7edb006a82a1e89853993d748304

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page