A theorem on the optimal allocation of effort
by Guillermo Owen
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)
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Group decision making, Decision making| Edition | Availability |
|---|---|
1
|
aaaa
|
Book Details
Edition 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
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
See All
History
- Created July 25, 2014
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| May 19, 2020 | Edited by CoverBot | Added new cover |
| July 25, 2014 | Created by ImportBot | Imported from Internet Archive item record |