Optimal Timing of Account Audits in Internal Control
Richard C. Morey and
David A. Dittman
Additional contact information
Richard C. Morey: Fuqua School of Business, Duke University, Durham, North Carolina 27706
David A. Dittman: University of Minnesota, Minneapolis, Minnesota 55455
Management Science, 1986, vol. 32, issue 3, 272-282
Abstract:
This paper calculates the minimum required frequency between audits of a given type to meet prespecified accuracy goals for a given type of account. Both "100 percent," as well as sampling type audits are addressed. The effectiveness of a given audit type includes the mean and standard deviation of any residual error that may remain in the account after the audit has been performed and after account balances have been adjusted. The accuracy goals consist of the maximum accumulated error that is considered by management to be tolerable between audits, and the prescribed likelihood that this tolerance level will not be exceeded. The model assumes that certain parameters of the error process have been estimated, but no distributional information is required. Closed form, easy to use, lot-size type formulae are derived which calculate the required frequency (or upper bounds) between audits. The model also provides insights as to the relative cost-effectiveness of various types of audits.
Keywords: frequency; accuracy; cost-effectiveness; confidence; tolerance (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (6)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.3.272 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:32:y:1986:i:3:p:272-282
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().