A theorem on the optimal allocation of effort

A limited time budget is to be allocated to 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...

Full description

Autores:
Grofman, Bernard
Owen, Guillermo
Tipo de recurso:
Article of journal
Fecha de publicación:
1987
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/43138
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/43138
http://bdigital.unal.edu.co/33236/
Palabra clave:
Symmetric linear
theorem
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional