An open API service indexing awesome lists of open source software.

https://github.com/cryptape/largest-remainder-method.rs

Largest remainder method
https://github.com/cryptape/largest-remainder-method.rs

allocating-seats-proportionally apportionment hamilton-method hare-niemeyer-method vinton-s-method vote

Last synced: about 1 year ago
JSON representation

Largest remainder method

Awesome Lists containing this project

README

          

# Largest remainder method

[![License]](#license)
[![Travis CI]](https://travis-ci.com/cryptape/largest-remainder-method.rs)
[![Crate]](https://crates.io/crates/largest-remainder-method.rs)

[License]: https://img.shields.io/badge/MIT-blue.svg
[Travis CI]: https://img.shields.io/travis/com/cryptape/largest-remainder-method.rs.svg
[Crate]: https://img.shields.io/crates/v/largest-remainder-method.svg

The largest remainder method (also known as Hare-Niemeyer method, Hamilton method or as Vinton's method[1]) is one way of allocating seats proportionally for representative assemblies with party list voting systems. It contrasts with the highest averages method.

[wiki](https://en.wikipedia.org/wiki/Largest_remainder_method)