Publication:
A theorem on the optimal allocation of effort

Loading...
Thumbnail Image
Authors
Owen, Guillermo
Grofman, Bernard
Subjects
Group Decisions
Advisors
Date of Issue
1984-10
Date
Te shnical Report for Period January 1984 - September 1984
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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 of 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.
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS-53-85-0003
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections