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

In some proportional electoral systems with more than one constituency the number of seats allotted to each constituency is pre-specified, as well as, the number of seats that each party has to receive at a national level. “Bidimensional allocation” of seats to parties within constituencies consists of converting the vote matrix V into an integer matrix of seats “as proportional as possible” to V, satisfying constituency and party totals and an additional “zero-vote zero-seat” condition. In the current Italian electoral law this Bidimensional Allocation Problem (or Biproportional Apportionment Problem—BAP) is ruled by an erroneous procedure that may produce an infeasible allocation, actually one that is not able to satisfy all the above conditions simultaneously.In this paper we focus on the feasibility aspect of BAP and, basing on the theory of (0,1)-matrices with given line sums, we formulate it for the first time as a “Matrix Feasibility Problem”. Starting from some previous results provided by Gale and Ryser in the 60’s, we consider the additional constraint that some cells of the output matrix must be equal to zero and extend the results by Gale and Ryser to this case. For specific configurations of zeros in the vote matrix we show that a modified version of the Ryser procedure works well, and we also state necessary and sufficient conditions for the existence of a feasible solution. Since our analysis concerns only special cases, its application to the electoral problem is still limited. In spite of this, in the paper we provide new results in the area of combinatorial matrix theory for (0,1)-matrices with fixed zeros which have also a practical application in some problems related to graphs.

[1]  D. Gale A theorem on flows in networks , 1957 .

[2]  H. Ryser Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[3]  D. R. Fulkerson Zero-one matrices with zero trace. , 1960 .

[4]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[5]  Richard P. Anstee,et al.  Properties of a class of $(0,,1)$-matrices covering a given matrix , 1982 .

[6]  Bruno Simeone,et al.  Evaluation and Optimization of Electoral Systems , 1987 .

[7]  Marjorie Gassner Two-dimensional rounding for a quasi-proportional representation , 1988 .

[8]  Michel Balinski,et al.  Algorithms for proportional matrices in reals and integers , 1989, Math. Program..

[9]  Michel Balinski,et al.  An Axiomatic Approach to Proportionality Between Matrices , 1989, Math. Oper. Res..

[10]  R. Brualdi Combinatorial Matrix Classes , 2006 .

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Yunsun Nam,et al.  Integral Matrices with Given Row and Column Sums , 1999, Ars Comb..

[13]  Geir Dahl,et al.  Matrices of zeros and ones with given line sums and a zero block , 2003 .

[14]  Yuguo Chen Simple existence conditions for zero-one matrices with at most one structural zero in each row and column , 2006, Discret. Math..

[15]  Geir Dahl,et al.  Constructing (0,1)-Matrices with Given Line Sums and Certain Fixed Zeros , 2007 .

[16]  G. Herman,et al.  Advances in discrete tomography and its applications , 2007 .

[17]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

[18]  Andrea Scozzari,et al.  Error minimization methods in biproportional apportionment , 2012 .

[19]  Andrea Scozzari,et al.  Network flow methods for electoral systems , 2012, Networks.