A theorem on the optimal allocation of effort
By: by Guillermo Owen and Bernard Grofman
Contributors: Grofman, Bernard; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1984
Place of publication: Monterey, California
Language: eng
Number of pages: 15
Subjects: Group decision making; Decision making
Description: A limited time budget is to be allocated to learning several tasks, so as to maximize the probability that a majority of these tasks will be performed correctly. It is shown that in the symmetric linear case, it is optimal to allocate time equally among k to the tasks, where k is at least a majority, but may be more, depending on the actual time available. In particular, time is allocated to all tasks if there is not much time available, but to only a majority of the tasks if the available amount of time is reasonably great. (Author)
Notes: Title from cover.

"Prepared for: Chief of Naval Research"--Cover.

"October 1984"--Cover.

"Technical report for period January 1984 - September 1984"--Cover.

"NPS-53-85-0003"--Cover.

Author(s) key words: Group decisions.

Includes bibliographical references (p. 13).

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1984.

kmc/kmc 12/1/09.

aq/aq cc:9116 07/18/97