A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
This is the full-length technical report for our shorter paper A Simple and Fast Linear-Time Algorithm for Divisor Methods of Apportionment, which is part of the special issue of Mathematical Programming B commemorating Michel L. Balinksi.
See the page for the journal version for details.