A theorem on the optimal allocation of effort

Simple item page
dc.contributor.authorOwen, Guillermo
dc.contributor.authorGrofman, Bernard
dc.contributor.corporateOperations Research (OR)
dc.contributor.corporateGraduate School of Operational and Information Sciences (GSOIS)
dc.dateTe shnical Report for Period January 1984 - September 1984
dc.date.accessioned2013-02-27T23:38:40Z
dc.date.available2013-02-27T23:38:40Z
dc.date.issued1984-10
dc.description.abstractA 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.en_US
dc.description.urihttp://archive.org/details/theoremonoptimal00owen
dc.identifier.npsreportNPS-53-85-0003
dc.identifier.urihttps://hdl.handle.net/10945/29558
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis 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.en_US
dc.subject.authorGroup Decisionsen_US
dc.subject.lcshMETEOROLOGY.en_US
dc.titleA theorem on the optimal allocation of efforten_US
dc.typeTechnical Reporten_US
dspace.entity.typePublication
relation.isOrgUnitOfPublication58745961-c46a-45ad-ae9c-d139d1ba1041
relation.isOrgUnitOfPublicationdd7f1b97-9c92-402d-b910-27f080946cde
relation.isOrgUnitOfPublication.latestForDiscoverydd7f1b97-9c92-402d-b910-27f080946cde
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
theoremonoptimal00owen.pdf
Size:
742.36 KB
Format:
Adobe Portable Document Format
Download
Collections
Reports