How to Count to One Thousand
An agent must verify that n objects are present. While counting, the agent might lose track and need to start over. The scheme that minimizes the expected counting time involves several layers in which objects are grouped into stacks, which are grouped into stacks of stacks, and so on. The size of each division depends only on the probability of making a mistake; the number of levels in the process increases with the logarithm of the size of the task. Variations on the model are introduced to investigate the optimal size of an organization employing presence of error-prone workers. Copyright 1992 by Royal Economic Society.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 102 (1992)
Issue (Month): 410 (January)
|Contact details of provider:|| Postal: 2 Dean Trench Street, Westminster, SW1P 3HE|
Phone: +44 20 3137 6301
Web page: http://www.res.org.uk/
More information through EDIRC
|Order Information:||Web: http://www.blackwellpublishers.co.uk/asp/journal.asp?ref=0013-0133|