Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach
From MaRDI portal
Publication:744689
DOI10.1007/S10479-013-1383-7zbMATH Open1296.90107OpenAlexW1986473559MaRDI QIDQ744689FDOQ744689
Authors: D. Pretolani
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/1061475
Recommendations
- Solving the generalized apportionment problem through the optimization of discrepancy functions
- An approximation algorithm for max-min fair allocation of indivisible goods
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem
- Logarithmic Gini mean difference measure for apportionment problem
- scientific article; zbMATH DE number 7366679
- Approximate \#knapsack computations to count semi-fair allocations
- ON A PARAMETRIC DIVISOR METHOD FOR THE APPORTIONMENT PROBLEM
- On rounding off quotas to the nearest integers in the problem of apportionment
- Gini index on generalized \(r\)-partitions
Statistical methods; economic indices and measures (91B82) Combinatorial optimization (90C27) Voting theory (91B12)
Cites Work
Cited In (5)
- A divisor apportionment method based on the Kolm-Atkinson social welfare function and generalized entropy
- Logarithmic Gini mean difference measure for apportionment problem
- Network models and biproportional rounding for fair seat allocations in the UK elections
- Celebrating the Memory of Corrado Gini: a Personality Out of the Ordinary
- Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem
Uses Software
This page was built for publication: Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744689)