Show simple item record

dc.contributor.authorRivest, Ronald L.
dc.contributor.authorPopa, Raluca A.
dc.contributor.authorAslam, Javed A.
dc.date.accessioned2015-04-14T21:15:14Z
dc.date.available2015-04-14T21:15:14Z
dc.date.issued2007-04-22
dc.identifier.urihttp://hdl.handle.net/1721.1/96591
dc.description.abstractWe consider the problem of statistical sampling for auditing elections, and we develop a remarkably simple and easily-calculated upper bound for the sample size necessary for determining with probability at least c whether a given set of n objects contains b or more “bad” objects. While the size of the optimal sample drawn without replacement can be determined with a computer program, our goal is to derive a highly accurate and simple formula that can be used by election officials equipped with only a simple calculator.en_US
dc.language.isoen_USen_US
dc.publisherCaltech/MIT Voting Technology Projecten_US
dc.relation.ispartofseriesVTP Working Paper Series;54
dc.subjectStatistical auditen_US
dc.subjectStatistical samplingen_US
dc.subjectAuditing electionsen_US
dc.titleOn Estimating the Size and Confidence of a Statistical Auditen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record