{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:29:33Z","timestamp":1768260573504,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T00:00:00Z","timestamp":1672185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CE48-0016"],"award-info":[{"award-number":["ANR-19-CE48-0016"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"Chilean National Agency for Research and Development","doi-asserted-by":"crossref","award":["Fondecyt 11190789"],"award-info":[{"award-number":["Fondecyt 11190789"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100020884","name":"Chilean National Agency for Research and Development","doi-asserted-by":"crossref","award":["Anillo ACT210005"],"award-info":[{"award-number":["Anillo ACT210005"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10107-022-01918-0","type":"journal-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:10:15Z","timestamp":1672236615000},"page":"135-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Apportionment with parity constraints"],"prefix":"10.1007","volume":"203","author":[{"given":"Claire","family":"Mathieu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-7356","authenticated-orcid":false,"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"key":"1918_CR1","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z., Li, Y., Oliveira R., Wigderson A.: Much faster algorithms for matrix scaling. In IEEE Symposium on Foundations of Computer Science (FOCS), pp. 890\u2013901 (2017)","DOI":"10.1109\/FOCS.2017.87"},{"issue":"2","key":"1918_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1080\/00029890.2008.11920503","volume":"115","author":"M Balinski","year":"2008","unstructured":"Balinski, M.: Fair majority voting (or how to eliminate gerrymandering). Am. Math. Mon. 115(2), 97\u2013113 (2008)","journal-title":"Am. Math. Mon."},{"issue":"1\u20133","key":"1918_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01589103","volume":"45","author":"M Balinski","year":"1989","unstructured":"Balinski, M., Demange, G.: Algorithms for proportional matrices in reals and integers. Math. Program. 45(1\u20133), 193\u2013210 (1989)","journal-title":"Math. Program."},{"issue":"4","key":"1918_CR4","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1287\/moor.14.4.700","volume":"14","author":"M Balinski","year":"1989","unstructured":"Balinski, M., Demange, G.: An axiomatic approach to proportionality between matrices. Math. Oper. Res. 14(4), 700\u2013719 (1989)","journal-title":"Math. Oper. Res."},{"key":"1918_CR5","doi-asserted-by":"crossref","unstructured":"Balinski, M., Laraki, R.: Majority Judgment: Measuring, Ranking, and Electing. MIT Press (2011)","DOI":"10.7551\/mitpress\/9780262015134.001.0001"},{"issue":"1","key":"1918_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1073\/pnas.77.1.1","volume":"77","author":"M Balinski","year":"1980","unstructured":"Balinski, M., Young, P.: The webster method of apportionment. Proc. Natl. Acad. Sci. 77(1), 1\u20134 (1980)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1918_CR7","unstructured":"Balinski, M., Young, P.: Fair Representation: Meeting the Ideal of One Man, One Vote. Brookings Institution Press (2010)"},{"key":"1918_CR8","doi-asserted-by":"crossref","unstructured":"Cembrano, J., Correa, J., Diaz, G., Verdugo, V.: Proportional apportionment: A case study from the chilean constitutional convention. In Equity and Access in Algorithms, Mechanisms, and Optimization (EAAMO), pp. 1\u20139 (2021)","DOI":"10.1145\/3465416.3483295"},{"issue":"15","key":"1918_CR9","doi-asserted-by":"publisher","first-page":"e2109305119","DOI":"10.1073\/pnas.2109305119","volume":"119","author":"J Cembrano","year":"2022","unstructured":"Cembrano, J., Correa, J., Verdugo, V.: Multidimensional political apportionment. Proc. Natl. Acad. Sci. 119(15), e2109305119 (2022)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1918_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Khanna, S.: Better and simpler error analysis of the Sinkhorn\u2013Knopp algorithm for matrix scaling. Math. Program. 188(1), 395\u2013407 (2021)","DOI":"10.1007\/s10107-020-01503-3"},{"key":"1918_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Madry, A., Tsipras, D., Vladu, A.: Matrix scaling and balancing via box constrained newton\u2019s method and interior point methods. In IEEE Symposium on Foundations of Computer Science (FOCS), pp. 902\u2013913 (2017)","DOI":"10.1109\/FOCS.2017.88"},{"issue":"4","key":"1918_CR12","first-page":"423","volume":"20","author":"L Cox","year":"1982","unstructured":"Cox, L., Ernst, L.: Controlled rounding. Inf. Syst. Oper. Res. 20(4), 423\u2013432 (1982)","journal-title":"Inf. Syst. Oper. Res."},{"issue":"03","key":"1918_CR13","doi-asserted-by":"publisher","first-page":"1340014","DOI":"10.1142\/S0219198913400148","volume":"15","author":"G Demange","year":"2013","unstructured":"Demange, G.: On allocating seats to parties and districts: apportionments. Int. Game Theory Rev. 15(03), 1340014 (2013)","journal-title":"Int. Game Theory Rev."},{"key":"1918_CR14","unstructured":"Diario Oficial de la Rep\u00fablica de Chile. Ley 20840. www.bcn.cl\/leychile\/navegar?idNorma=1077039 (2015)"},{"key":"1918_CR15","unstructured":"Diario Oficial de la Rep\u00fablica de Chile. Ley 21216. www.bcn.cl\/leychile\/navegar?idNorma=1143661 (2020)"},{"key":"1918_CR16","unstructured":"Endriss, U.: Trends in Computational Social Choice (2017)"},{"issue":"2","key":"1918_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.mathsocsci.2008.01.004","volume":"56","author":"N Gaffke","year":"2008","unstructured":"Gaffke, N., Pukelsheim, F.: Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems. Math. Soc. Sci. 56(2), 166\u2013184 (2008)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"1918_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00186-007-0184-7","volume":"67","author":"N Gaffke","year":"2008","unstructured":"Gaffke, N., Pukelsheim, F.: Vector and matrix apportionment problems and separable convex integer optimization. Math. Methods Oper. Res. 67(1), 133\u2013159 (2008)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"1918_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1177\/0951692891003003005","volume":"3","author":"MB Gassner","year":"1991","unstructured":"Gassner, M.B.: Biproportional delegations: a solution for two-dimensional proportional representation. J. Theor. Polit. 3(3), 321\u2013342 (1991)","journal-title":"J. Theor. Polit."},{"key":"1918_CR20","unstructured":"Idel, M.: A review of matrix scaling and Sinkhorn\u2019s normal form for matrices and positive maps. arXiv preprint arXiv: 1609.06349 (2016)"},{"key":"1918_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0024-3795(94)00188-X","volume":"240","author":"B Kalantari","year":"1996","unstructured":"Kalantari, B., Khachiyan, L.: On the complexity of nonnegative-matrix scaling. Linear Algebra Appl. 240, 87\u2013103 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"1918_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-006-0021-4","volume":"112","author":"B Kalantari","year":"2008","unstructured":"Kalantari, B., Lari, I., Ricca, F., Simeone, B.: On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Math. Program. 112(2), 371\u2013401 (2008)","journal-title":"Math. Program."},{"key":"1918_CR23","unstructured":"Maier, S., Pukelsheim, F.: Bazi: A free computer program for proportional representation apportionment (2007)"},{"issue":"2","key":"1918_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1287\/mnsc.1090.1118","volume":"56","author":"S Maier","year":"2010","unstructured":"Maier, S., Zachariassen, P., Zachariasen, M.: Divisor-based biproportional apportionment in electoral systems: a real-life benchmark study. Manag. Sci. 56(2), 373\u2013387 (2010)","journal-title":"Manag. Sci."},{"key":"1918_CR25","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0024-3795(99)00212-8","volume":"302","author":"A Nemirovski","year":"1999","unstructured":"Nemirovski, A., Rothblum, U.: On complexity of matrix scaling. Linear Algebra Appl. 302, 435\u2013460 (1999)","journal-title":"Linear Algebra Appl."},{"key":"1918_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.mathsocsci.2016.02.003","volume":"80","author":"K-F Oelbermann","year":"2016","unstructured":"Oelbermann, K.-F.: Alternate scaling algorithm for biproportional divisor methods. Math. Soc. Sci. 80, 25\u201332 (2016)","journal-title":"Math. Soc. Sci."},{"key":"1918_CR27","doi-asserted-by":"crossref","unstructured":"Pukelsheim, F.: Proportional Representation. Springer (2017)","DOI":"10.1007\/978-3-319-64707-4"},{"issue":"1","key":"1918_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/net.20480","volume":"59","author":"F Pukelsheim","year":"2012","unstructured":"Pukelsheim, F., Ricca, F., Simeone, B., Scozzari, A., Serafini, P.: Network flow methods for electoral systems. Networks 59(1), 73\u201388 (2012)","journal-title":"Networks"},{"key":"1918_CR29","unstructured":"Ricca, F., Scozarri, A., Serafini, P.: A guided tour of the mathematics of seat allocation and political districting. In: Endriss, U. (ed.) Trends in Comput. Soc. Choice, pp. 49\u201368 (2017)"},{"key":"1918_CR30","unstructured":"Rote, G., Zachariasen, M.: Matrix scaling by network flow. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 848\u2013854 (2007)"},{"issue":"2","key":"1918_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/net.20434","volume":"59","author":"P Serafini","year":"2012","unstructured":"Serafini, P., Simeone, B.: Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment. Networks 59(2), 191\u2013208 (2012)","journal-title":"Networks"},{"issue":"2","key":"1918_CR32","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R Sinkhorn","year":"1964","unstructured":"Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Stat. 35(2), 876\u2013879 (1964)","journal-title":"Ann. Math. Stat."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01918-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01918-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01918-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T18:08:14Z","timestamp":1707502094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01918-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1918"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01918-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}