IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v20y2012i3p547-577.html
   My bibliography  Save this article

Error minimization methods in biproportional apportionment

Author

Listed:
  • Federica Ricca
  • Andrea Scozzari
  • Paolo Serafini
  • Bruno Simeone

Abstract

One of the most active research lines in the area of electoral systems to date deals with the Biproportional Apportionment Problem, which arises in those proportional systems where seats must be allocated to parties within territorial constituencies. A matrix of the vote counts of the parties within the constituencies is given, and one has to convert the vote matrix into an integer matrix of seats “as proportional as possible” to it, subject to the constraints that each constituency be granted its pre-specified number of seats, each party be allotted the total number of seats it is entitled to on the basis of its national vote count, and a zero-vote zero-seat condition be satisfied. The matrix of seats must simultaneously meet the integrality and the proportionality requirement, and this not infrequently gives rise to self-contradictory procedures in the electoral laws of some countries. Here we discuss a class of methods for Biproportional Apportionment characterized by an “error minimization” approach. If the integrality requirement is relaxed, fractional seat allocations (target shares) can be obtained so as to achieve proportionality at least in theory. In order to restore integrality, one then looks for integral apportionments that are as close as possible to the ideal ones in a suitable metric. This leads to the formulation of constrained optimization problems called “best approximation problems” which are solvable in polynomial time through the use of network flow techniques. These error minimization methods can be viewed as an alternative to the classical axiomatic approach introduced by Balinski and Demange (in Math Oper Res 14:700–719, 1989a ; Math Program 45:193–210, 1989b ). We provide an empirical comparison between these two approaches with a real example from the Italian Elections and a theoretical discussion about the axioms that are not necessarily satisfied by the error minimization methods. Copyright Sociedad de Estadística e Investigación Operativa 2012

Suggested Citation

  • Federica Ricca & Andrea Scozzari & Paolo Serafini & Bruno Simeone, 2012. "Error minimization methods in biproportional apportionment," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 547-577, October.
  • Handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:547-577
    DOI: 10.1007/s11750-012-0252-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-012-0252-x
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11750-012-0252-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dan S. Felsenthal & Moshé Machover (ed.), 2012. "Electoral Systems," Studies in Choice and Welfare, Springer, number 978-3-642-20441-8, July.
    2. Gabrielle Demange & Michel L. Balinski, 1989. "An Axiomatic Approach to Proportionality between Matrices," Post-Print halshs-00670952, HAL.
    3. Marjorie Gassner, 1989. "An impossibility theorem for fair bidimensional representation: Towards a biproportional solution," ULB Institutional Repository 2013/232154, ULB -- Universite Libre de Bruxelles.
    4. Minoux, M., 1984. "A polynomial algorithm for minimum quadratic cost flow problems," European Journal of Operational Research, Elsevier, vol. 18(3), pages 377-387, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Haydar Evren & Manshu Khanna, 2021. "Affirmative Action's Cumulative Fractional Assignments," Papers 2111.11963, arXiv.org, revised Feb 2024.
    2. Sascha Kurz & Stefan Napel, 2014. "Heuristic and exact solutions to the inverse power index problem for small voting bodies," Annals of Operations Research, Springer, vol. 215(1), pages 137-163, April.
    3. Isabella Lari & Federica Ricca & Andrea Scozzari, 2014. "Bidimensional allocation of seats via zero-one matrices with given line sums," Annals of Operations Research, Springer, vol. 215(1), pages 165-181, April.
    4. Kerem Akartunalı & Philip A. Knight, 2017. "Network models and biproportional rounding for fair seat allocations in the UK elections," Annals of Operations Research, Springer, vol. 253(1), pages 1-19, June.
    5. Paolo Serafini, 2015. "Certificates of optimality for minimum norm biproportional apportionments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(1), pages 1-12, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Paolo Serafini, 2015. "Certificates of optimality for minimum norm biproportional apportionments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(1), pages 1-12, January.
    2. Marjorie B. Gassner, 1991. "Biproportional Delegations," Journal of Theoretical Politics, , vol. 3(3), pages 321-342, July.
    3. Oelbermann, Kai-Friederike, 2016. "Alternate Scaling algorithm for biproportional divisor methods," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 25-32.
    4. Ahuja, Ravindra K., 1956- & Kanpur, I. I. T. & Orlin, James B., 1953-, 1993. "A capacity scaling algorithm for the constrained maximum flow problem," Working papers 3587-93., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    6. Gabrielle Demange, 2021. "On the resolution of cross-liabilities," PSE Working Papers halshs-03151128, HAL.
    7. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    8. Michel Balinski, 2007. "Equitable representation and recruitment," Annals of Operations Research, Springer, vol. 149(1), pages 27-36, February.
    9. Demange, Gabrielle, 2017. "Mutual rankings," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 35-42.
    10. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    11. Demange, Gabrielle, 2012. "On party-proportional representation under district distortions," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 181-191.
    12. Michel L. Balinski & Gabrielle Demange, 1989. "Algorithm for Proportional Matrices in Reals and Integers," Post-Print halshs-00585327, HAL.
    13. Gabrielle Demange, 2018. "New electoral systems and old referendums," PSE Working Papers hal-01852206, HAL.
    14. Gabrielle Demange, 2013. "On Allocating Seats To Parties And Districts: Apportionments," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(03), pages 1-14.
    15. MESNARD, Louis de, 1999. "Interpretation of the RAS method : absorption and fabrication effects are incorrect," LATEC - Document de travail - Economie (1991-2003) 9907, LATEC, Laboratoire d'Analyse et des Techniques EConomiques, CNRS UMR 5118, Université de Bourgogne.
    16. David Wu & Viet Hung Nguyen & Michel Minoux & Hai Tran, 2022. "Optimal deterministic and robust selection of electricity contracts," Journal of Global Optimization, Springer, vol. 82(4), pages 993-1013, April.
    17. Steven J. Brams & D. Marc Kilgour & Richard F. Potthoff, 2019. "Multiwinner approval voting: an apportionment approach," Public Choice, Springer, vol. 178(1), pages 67-93, January.
    18. Attila Tasnádi, 2008. "The extent of the population paradox in the Hungarian electoral system," Public Choice, Springer, vol. 134(3), pages 293-305, March.
    19. Friedrich Pukelsheim, 2014. "Biproportional scaling of matrices and the iterative proportional fitting procedure," Annals of Operations Research, Springer, vol. 215(1), pages 269-283, April.
    20. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:547-577. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.