A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections

Authors:
A. S. Belenky
Affiliations:
NISTRAMAN Consulting, P.O.Box 1314 Brookline, MA 02446, USA and Center for Engineering Systems Fundamentals, Massachusetts Institute of Technology, USA
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2008

Citing 2
Cited 1

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Management Science
Calculating the minimal fraction of thepopular vote to win the U.S. Presidency in the electoral college

Computers & Mathematics with Applications

A note on permutations and rank aggregation

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

The minimal fractions of the popular vote that could have elected a US President in the Electoral College in two-party elections in 1948-2004 are calculated by solving auxiliary knapsack problems. It is shown that under the rules of US presidential elections determined by Article 2 of the US Constitution, the values of these minimal fractions were within the range 16.072%-22.103%.