Rounding with multiplier methods: An efficient algorithm and applications in statistics
The authors consider roundings for sums which satisfy prescribed summation restrictions such as percentages summing up to 100\%. For given weights \(w_1,\dots, w_c>0\) \((c\geq 2)\) and for some multiplier \(\nu\in (0,\infty)\) the expressions \(\nu w_i/\sum^c_{j=1} w_j\), \(i= 1,\dots, c\) are rounded appropriately to integers \(n_i\), \(i=1,\dots, c\) such that \(\sum^c_{i=1} n_i= n\) holds for some fixed positive integer \(n\). An iterative algorithm is presented which computes \(n_i\) in a finite number of steps. It is based on a sign-post sequence which is defined in the paper. Multiple solutions and special classes of multiplier rounding methods are discussed; some of the methods are applied to three fields in statistics.
- scientific article; zbMATH DE number 1069356
- scientific article; zbMATH DE number 1045885
- Rounding probabilities: Maximum probability and minimum complexity multipliers
- On stationary multiplier methods for the rounding of probabilities and the limiting law of the Sainte-Laguë divergence
- scientific article; zbMATH DE number 937471
- Efficient rounding of sampling allocations
- scientific article; zbMATH DE number 3549966 (Why is no real title available?)
- scientific article; zbMATH DE number 1069356 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- scientific article; zbMATH DE number 937471 (Why is no real title available?)
- On Rounding Percentages
- Rounding probabilities: Maximum probability and minimum complexity multipliers
- Rounding Proportions:Rules of Rounding
- Asymptotic equivalence of seat bias models
- Surface volumes of rounding polytopes
- Rounding probabilities: Maximum probability and minimum complexity multipliers
- Vector and matrix apportionment problems and separable convex integer optimization
- Linear-time algorithms for proportional apportionment
- scientific article; zbMATH DE number 1069356 (Why is no real title available?)
- Degree-Constrained Network Spanners with Nonconstant Delay
- Optimal time plan in accelerated degradation testing
- A generalized parametric divisor method for political apportionment
- A simple and fast linear-time algorithm for divisor methods of apportionment
- Goodness-of-fit criteria for the Adams and Jefferson rounding methods and their limiting laws
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
- Evaluation of thresholds for power mean-based and other divisor methods of apportionment
This page was built for publication: Rounding with multiplier methods: An efficient algorithm and applications in statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290857)
