Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

DOI10.1002/net.20434zbMath1241.91044OpenAlexW2136443115MaRDI QIDQ2892156

Paolo Serafini, Bruno Simeone

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20434

zbMATH Keywords

electoral systemslexicographic optimizationparametric maximum flowbiproportional apportionment

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Voting theory (91B12)

Related Items (10)

Alternate scaling algorithm for biproportional divisor methods ⋮ Network flow methods for electoral systems ⋮ Network models and biproportional rounding for fair seat allocations in the UK elections ⋮ Error minimization methods in biproportional apportionment ⋮ Apportionment with parity constraints ⋮ Fair apportionment in the view of the Venice Commission's recommendation ⋮ Allocation of the EU parliament seats via integer linear programming and revised quotas ⋮ Certificates of optimality: the third way to biproportional apportionment ⋮ Multi-attribute proportional representation ⋮ Certificates of optimality for minimum norm biproportional apportionments

Uses Software

• LINDO
• Bazi

Cites Work

• Unnamed Item
• Unnamed Item
• Certificates of optimality: the third way to biproportional apportionment
• A polynomial algorithm for minimum quadratic cost flow problems
• A theorem on flows in networks
• Complexity and algorithms for convex network optimization and other nonlinear problems
• Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems
• Algorithms for proportional matrices in reals and integers
• A bi-proportional method applied to the spanish congress
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• Vector and matrix apportionment problems and separable convex integer optimization
• An Axiomatic Approach to Proportionality Between Matrices
• Solving integer minimum cost flows with separable convex cost objective polynomially
• On the structure of all minimum cuts in a network and applications
• Controlled Rounding
• Evaluation and Optimization of Electoral Systems
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications

This page was built for publication: Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment