Bidimensional allocation of seats via zero-one matrices with given line sums
DOI10.1007/S10479-013-1440-2zbMATH Open1303.91100OpenAlexW2082753919MaRDI QIDQ744674FDOQ744674
Authors: Isabella Lari, Federica Ricca, Andrea Scozzari
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
Recommendations
electoral systems\((0,1)\)-matrices with given line sumsbidimensional allocationmatrices with fixed zeros
History, political science (91F10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Voting theory (91B12) Sign pattern matrices (15B35)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Combinatorial matrix classes
- Title not available (Why is that?)
- A theorem on flows in networks
- Title not available (Why is that?)
- Algorithms for proportional matrices in reals and integers
- An Axiomatic Approach to Proportionality Between Matrices
- Controlled Rounding
- Combinatorial Properties of Matrices of Zeros and Ones
- Zero-one matrices with zero trace
- Constructing \((0,1)\)-matrices with given line sums and certain fixed zeros
- Evaluation and Optimization of Electoral Systems
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Matrices of zeros and ones with given line sums and a zero block
- Simple existence conditions for zero-one matrices with at most one structural zero in each row and column
- Network flow methods for electoral systems
- Error minimization methods in biproportional apportionment
- Integral matrices with given row and column sums
Cited In (3)
This page was built for publication: Bidimensional allocation of seats via zero-one matrices with given line sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744674)