Bidimensional allocation of seats via zero-one matrices with given line sums

DOI10.1007/s10479-013-1440-2zbMath1303.91100OpenAlexW2082753919MaRDI QIDQ744674

Isabella Lari, Andrea Scozzari, Federica Ricca

Publication date: 26 September 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1440-2

zbMATH Keywords

electoral systems\((0,1)\)-matrices with given line sumsbidimensional allocationmatrices with fixed zeros

Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Sign pattern matrices (15B35)

Related Items (2)

Multi-attribute proportional representation ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros

Cites Work

• A theorem on flows in networks
• Zero-one matrices with zero trace
• Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
• Algorithms for proportional matrices in reals and integers
• Error minimization methods in biproportional apportionment
• Network flow methods for electoral systems
• An Axiomatic Approach to Proportionality Between Matrices
• Combinatorial Properties of Matrices of Zeros and Ones
• Properties of a Class of (0,1)-Matrices Covering a given Matrix
• Controlled Rounding
• Evaluation and Optimization of Electoral Systems
• Matrices of zeros and ones with given line sums and a zero block
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bidimensional allocation of seats via zero-one matrices with given line sums