Rounding probabilities: Maximum probability and minimum complexity multipliers

DOI10.1016/S0378-3758(99)00077-4zbMath0974.60009OpenAlexW2043766215MaRDI QIDQ1973292

Max Happacher, Friedrich Pukelsheim

Publication date: 8 May 2001

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(99)00077-4

zbMATH Keywords

convolutionmultiplier methodsdiscrepancyroundoff errorunimodalityasymptotic shiftstationary rounding functions

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Roundoff error (65G50)

Related Items (3)

Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems ⋮ Vector and matrix apportionment problems and separable convex integer optimization ⋮ Rounding with multiplier methods: An efficient algorithm and applications in statistics

Cites Work

• Rounding with multiplier methods: An efficient algorithm and applications in statistics
• On Rounding Percentages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rounding probabilities: Maximum probability and minimum complexity multipliers