A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
From MaRDI portal
Publication:1007645
DOI10.1016/J.MCM.2007.10.012zbMATH Open1156.91468OpenAlexW2012063483MaRDI QIDQ1007645FDOQ1007645
Authors: A. S. Belen'kij
Publication date: 23 March 2009
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2007.10.012
Recommendations
- Calculating the minimal fraction of the popular vote to win the U.S. presidency in the electoral college
- A mathematical programming approach to key-based election analysis
- A modified ``winner-take-all rule for awarding state electoral votes in US presidential elections and a game model for its analysis
- “One Man, One Vote” Part 1: Electoral Justice in the U.S. Electoral College: Banzhaf and Shapley/Shubik Versus May
- A New Approach to Estimating the Probability of Winning the Presidency
Cites Work
Cited In (6)
- A mathematical programming approach to key-based election analysis
- A modified ``winner-take-all rule for awarding state electoral votes in US presidential elections and a game model for its analysis
- A note on permutations and rank aggregation
- A New Approach to Estimating the Probability of Winning the Presidency
- Calculating the minimal fraction of the popular vote to win the U.S. presidency in the electoral college
- A mixed integer linear program for election campaign optimization under D'Hondt rule
Uses Software
This page was built for publication: A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007645)