摘要：AbstractApportionment in election systems refers to determination of the number of voting resources (poll books, poll workers, or voting machines) needed to ensure that all voters can expect to wait no longer than an appropriate amount, even the voter who waits the longest. Apportionment is a common problem for election officials and legislatures. A related problem is “allocation,” which relates to the deployment of an existing number of resources so that the longest expected wait is held to an appropritate amount. Provisioning and allocation are difficult because the numbers of expected voters, the ballot lengths, and the education levels of voters may all differ significantly from precinct-to-precinct in a county. Consider that predicting the waiting time of the voter who waits the longest generally requires discrete event simulation.•The methods here rigorously guarantee that all voters expect to wait a prescribed time with a bounded probability, e.g., everyone expects to wait less than thirty minutes with probability greater than 95%.•The methods here can handle both a single type of resource (e.g., voting machines or scan machines) and multiple resource types (e.g., voting machines and poll books).•The methods are provided in a freely available, easy-to-use Excel software program.Graphical abstractDisplay Omitted
关键词：Simulation optimization;Multiple comparisons;Comparison with the best;Election systems;Voting machine, Allocation;Resource management;Consumer requirements management;Indifference-zone
