 | 2008 |
| 11 |  | Alex S. Belenky:
A 0-1 knapsack model for evaluating the possible Electoral College performance in two-party US presidential elections.
Mathematical and Computer Modelling 48(5-6): 665-676 (2008) |
| 10 |  | Alex S. Belenky:
From the editor: Systems studies of voting systems and elections.
Mathematical and Computer Modelling 48(9-10): 1295-1297 (2008) |
| 9 |  | Alex S. Belenky:
A modified "winner-take-all" rule for awarding state electoral votes in US presidential elections and a game model for its analysis.
Mathematical and Computer Modelling 48(9-10): 1308-1325 (2008) |
| 8 |  | Alex S. Belenky:
Forthcoming: How America Chooses Its Presidents, Second Edition, by Alexander S. Belenky.
Mathematical and Computer Modelling 48(9-10): 1663-1665 (2008) |
| 2007 |
| 7 |  | Alex S. Belenky:
The continuity of two functions associated with a maximin problem with connected variables.
Appl. Math. Lett. 20(7): 773-777 (2007) |
| 6 |  | Alex S. Belenky:
Finding the exact lower estimate of the maximin of a minimum function on a polyhedron of connected variables.
Appl. Math. Lett. 20(7): 795-799 (2007) |
| 5 |  | Alex S. Belenky,
David C. King:
A mathematical model for estimating the potential margin of state undecided voters for a candidate in a US Federal election.
Mathematical and Computer Modelling 45(5-6): 585-593 (2007) |
| 4 |  | Alex S. Belenky:
Estimating the size of the calling population in finite-source election queues by bilinear programming techniques.
Mathematical and Computer Modelling 45(7-8): 873-882 (2007) |
| 2006 |
| 3 |  | Alex S. Belenky:
Two Rules of a Sealed Ceiling Bid and Their Analysis by Mathematical Programming Techniques.
Computers & Mathematics with Applications 52(12): 1711-1732 (2006) |
| 2003 |
| 2 |  | Alex S. Belenky:
Two noncooperative games between a coalition and its surrounding in a class of n-person games with constant sum.
Appl. Math. Lett. 16(5): 683-687 (2003) |
| 1 |  | Alex S. Belenky:
Choosing a preferable strategy by the surrounding of a coalition in n-person games.
Appl. Math. Lett. 16(5): 689-694 (2003) |