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.8.tar.gz (26.7 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.8-py3-none-any.whl (28.6 kB view details)

Uploaded Python 3

File details

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

File metadata

  • Download URL: optimal_voting-0.0.8.tar.gz
  • Upload date:
  • Size: 26.7 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.8.tar.gz
Algorithm Hash digest
SHA256 5d2a4d6639ddf9d92cfea60e8557b49b228a4d8ed6001c22a4b1787065c1b9cb
MD5 c5d14bc37c0a16874990a619794af184
BLAKE2b-256 a09292f8b7b0195ba4abe011d9bc96e4db18a418848d9b5ebc05882dbef26104

See more details on using hashes here.

File details

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

File metadata

  • Download URL: optimal_voting-0.0.8-py3-none-any.whl
  • Upload date:
  • Size: 28.6 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.8-py3-none-any.whl
Algorithm Hash digest
SHA256 14a49a936e296ae315be60d69615ff3d46a41d7370fad7400fac486ae7d7bb57
MD5 6d184e3031f23df6ddb3eef0ad680ab9
BLAKE2b-256 12ce7c708f691c429e492af491c4882b88a06e1a342f71d6f105b489c50e8da7

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