_:N7474ffebb14542088dc47ff06cb155c2 .
.
"Department of Statistics, University La Sapienza, Rome, Italy" .
.
_:N1e01295f28634e21b1b1d9c2de3c58e2 .
.
.
.
.
"2012-02-01" .
.
.
_:N128d6945b93f45e6884f2843818fe044 .
.
"Serafini" .
_:Nae43bf2f4fa8427b9014f5c51a1c5552 "Springer Nature - SN SciGraph project" .
_:Nae43bf2f4fa8427b9014f5c51a1c5552 .
"University of Udine" .
.
_:Nd78c5a6f574c47aa8dad9f649b5037f1 "28f000fc95018e139e7e2ad40cfd131549a95e9484819e6a8754ac59e737248b" .
.
.
"Simeone" .
"1432-217X" .
.
.
_:Nae43bf2f4fa8427b9014f5c51a1c5552 .
"true"^^ .
.
.
"Sapienza University of Rome" .
.
_:Nb04c38cb41fe4a7c8e4e4389c2a43fa1 "10.1007/s00355-010-0528-8" .
"0176-1714" .
.
.
"research_article" .
_:Nb04c38cb41fe4a7c8e4e4389c2a43fa1 .
.
.
.
.
_:N1e01295f28634e21b1b1d9c2de3c58e2 .
"Department of Mathematics and Computer Science, University of Udine, Udine, Italy" .
"Certificates of optimality: the third way to biproportional apportionment" .
.
.
"Paolo" .
_:N7474ffebb14542088dc47ff06cb155c2 .
_:N1e01295f28634e21b1b1d9c2de3c58e2 _:N7474ffebb14542088dc47ff06cb155c2 .
_:Nd78c5a6f574c47aa8dad9f649b5037f1 .
_:N128d6945b93f45e6884f2843818fe044 "dimensions_id" .
_:N1320c7591c534721990286ceb6834b1a .
_:Nd78c5a6f574c47aa8dad9f649b5037f1 "readcube_id" .
.
.
.
.
_:N048717e92abc43978846cea694ec3af0 "38" .
.
.
.
.
"http://link.springer.com/10.1007/s00355-010-0528-8" .
"The biproportional apportionment problem (BAP) must be faced in many proportional electoral systems where seats must be allocated to parties within regions. BAP is a non-trivial optimization problem, and only sophisticated algorithms are currently available for solving it. The issue is: are they \u201Cwritable\u201D as an actual law? Citizens rightly demand simple, easy to understand, voting systems. The alternative, though, seems to have simple, but unsound electoral laws. We propose the following way out of this dilemma: leave to a mathematically sophisticated algorithm the task of producing an optimal apportionment, but attach to it a \u201Ccertificate of optimality\u201D, that is, describe a simple procedure whereby anybody can check, through some elementary operations, that the seat allocation output by the algorithm is indeed an optimal apportionment. We discuss one such certificate, based on the Max flow- min cut Theorem, relative to a parametric max flow method of ours for BAP." .
"articles" .
.
"Numerical and Computational Mathematics" .
_:N128d6945b93f45e6884f2843818fe044 "pub.1008592628" .
.
.
"Social Choice and Welfare" .
.
.
.
.
.
.
_:N048717e92abc43978846cea694ec3af0 .
"247-268" .
_:N1320c7591c534721990286ceb6834b1a "2" .
_:Nb04c38cb41fe4a7c8e4e4389c2a43fa1 .
"en" .
"2019-04-10T20:39" .
_:N048717e92abc43978846cea694ec3af0 .
_:N1320c7591c534721990286ceb6834b1a .
"2012-02" .
"Bruno" .
.
"https://scigraph.springernature.com/explorer/license/" .
_:Nb04c38cb41fe4a7c8e4e4389c2a43fa1 "doi" .
.
_:N128d6945b93f45e6884f2843818fe044 .
.
"Mathematical Sciences" .
.
_:Nd78c5a6f574c47aa8dad9f649b5037f1 .
.