Network models and biproportional rounding for fair seat allocations in the UK elections

@article{Akartunal2017NetworkMA,
  title={Network models and biproportional rounding for fair seat allocations in the UK elections},
  author={Kerem Akartunalı and Philip A. Knight},
  journal={Annals of Operations Research},
  year={2017},
  volume={253},
  pages={1-19}
}
Systems for allocating seats in an election offer a number of socially and mathematically interesting problems. We discuss how to model the allocation process as a network flow problem, and propose a wide choice of objective functions and allocation schemes. Biproportional rounding, which is an instance of the network flow problem, is used in some European countries with multi-seat constituencies. We discuss its application to single seat constituencies and the inevitable consequence that seats… 

A model for multi-class road network recovery scheduling of regional road networks

An optimisation model for recovery planning of road networks is presented in which both social and economic resilience is aimed to be achieved and it is illustrated how the Pareto-optimal solutions achieved by the multi-objective optimisation can vary depending on the emphasis placed on different classes of vehicles.

A matheuristic for the swap body vehicle routing problem

A column generation-based approach, in which a variable neighborhood search heuristic populates the route pool, and Comparisons with existing metaheuristics show that this strategy is suitable for solving the swap body vehicle routing problem.

Government regulation and enterprise decision in China remanufacturing industry: evidence from evolutionary game theory

The evolutionary game model was established in order to analyze the optimal strategies for both the government and the enterprises and shows that the regulation of government will exert the significant influences to firms’ decision about re manufacturing.

Tensor Balancing on Statistical Manifold

The key to the algorithm is that the gradient of the manifold, used as a Jacobian matrix in Newton's method, can be analytically obtained using the Moebius inversion formula, the essential of combinatorial mathematics.

Research on Unequal Area Facility Layout Problem of Packaging Test Workshop Manufacturing Units in Semiconductor Company

An improved bat algorithm for re-layout planning based on the double-layer structure of the workshop, the unequal area of theworkshop and the production status of multi-variety products is put forward with the goal of minimizing material handling cost and maximizing the utilization rate of workshop area.

Fuzzy Chance Constrained Twin Support Vector Machine for Uncertain Classification

A new fuzzy chance constrained twin support vector machine (FCC-TWSVM) via chance constrained programming formulation and fuzzy membership is proposed, which can deal data with measurement noise efficiently and is transformed to second-order cone programming (SOCP) by the properties of moment information of uncertain data.

Detecting Falsified Financial Statements Using a Hybrid SM-UTADIS Approach : Empirical Analysis of Listed Traditional Chinese Medicine Companies in China

The proposed hybrid approach greatly improves the accuracy of FFS detection and uses other approaches, such as single UTADIS and logistic and SM-logistic regression models, to detect FFS.

References

SHOWING 1-10 OF 35 REFERENCES

Network Models and Biproportional Apportionment for Fair Seat Allocations in the UK Elections

This work introduces a parameter based family of methods which can be tuned to meet the public’s demand for local and global “fairness”, and study a variety of network models and biproportional apportionments.

Network flow methods for electoral systems

It is fair to state that network flow models and algorithms are indeed very flexible and effective tools for the analysis and the design of contemporary electoral systems.

Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment

This article considers the minimization of both the maximum absolute error and the maximum relative error of the apportioned seats with respect to target quotas, and shows that this can be done polynomially through a reduction to a parametric maximum flow problem.

Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study

This work evaluates the general quality of divisor-based biproportional apportionment with respect to deviation from quota, reversal orderings, and occurrences of ties in electoral systems where the electoral region is subdivided into electoral districts.

Matrices and politics

Biproportional apportionment methods provide a novel approach of translating electoral votes into parliamentary seats. A two-way proportionality is achieved, to districts relative to their

Fair Majority Voting (or How to Eliminate Gerrymandering)

Recent congressional elections (especially those of 2002 and 2004)— summarized in Table 1—show the shocking impact of gerrymandering.

Apportionments with minimum Gini index of disproportionality: a Quadratic Knapsack approach

This work proposes a quotient method that minimizes the Gini index of disproportionality, which reduces the rounding of quotas to an instance of quadratic knapsack, a widely studied combinatorial optimization problem.

Stability, Coalitions and Schisms in Proportional Representation Systems

Methods to allocate seats in proportional representation systems are investigated in terms of underlying common-sense properties, and a new concept of uniformity is introduced which seems inherent in the very idea of the word "method", and it is shown to uniquely determine certain methods.

Electoral Bias at the 2010 General Election: Evaluating its Extent in a Three‐Party System

Abstract The three‐party method for bias decomposition shows that after the 2010 general election Labour continues to benefit from a positive bias but that its advantage over the Conservative party