A decision theoretic approach to file search
- 45 Downloads
We investigate the relationship between algorithm construction and optimal decision processes. We provide a sufficient condition, a linear ordering over the experiment set, for when we can efficiently use an optimization approach for selecting a decision strategy. We demonstrate the linear ordering condition within the context of the file search problem; however, any problem whose representation satisfies the linear ordering condition is amenable to the optimization approach.
Key wordsDecision theory optimization file search algorithm design
Unable to display preview. Download preview PDF.
- Aho, A., Hopcroft, J., and Ullman, J., 1974, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass.Google Scholar
- Bradley, S., Hax, A., and Magnanti, T., 1977, Applied Mathematical Programming, Addison-Wesley, Reading, Mass.Google Scholar
- Moore, J. and Whinston, A., 1986, A model of decision-making with sequential information acquisition, (Part 1), Decision Support Systems 2, 285–307.Google Scholar
- Moore, J. and Whinston, A., 1987, A model of decision-making with sequential information acquisition, (Part 2), Decision Support Systems 3, 47–72.Google Scholar
- Moore, J., Richmond, W., and Whinston, A., 1987, Choice theory and data base management, Working Paper, Krannert Graduate School of Management, Purdue University.Google Scholar
- Raiffa, H., 1968, Decision Analysis: Introductory Lectures on Choices Under Uncertainty, Addison-Wesley, Mass.Google Scholar