Computational Delays

S. D. Deshmukh
Additional contact information
S. D. Deshmukh: Northwestern University

Management Science, 1974, vol. 21, issue 3, 330-340

Abstract: Decision-making processes usually involve time-consuming and costly operations of observation and communication of the state of the environment and generation and implementation of appropriate actions. Collectively these activities may be called computational and the procedure required to carry them out may be called an algorithm. If the environment is changing stochastically the fixed computational delay involved in operating the algorithm yields obsolete actions resulting in reduced expected return. The loss as a function of delay is a measure of efficiency of the algorithm which depends upon the stochastic properties of the environment. If it is possible to reduce the loss by employing a faster algorithm at a higher cost, the algorithm may be optimally designed and selected from a given family.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.21.3.330 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1974:i:3:p:330-340

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().