Allocation of computational resource in economic search
type: Item
instance of: scholarly article
zbMATH Open document ID: 1032.90059
author: Violetta Galant
author: Richard F. Bonner
publication date: 2001-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 91B44
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1646471
zbMATH Keywords: economic search problem
zbMATH Keywords: incremental approximation
zbMATH Keywords: resource bounds
zbMATH Keywords: Markov decision process
MaRDI profile type: Publication
title: Allocation of computational resource in economic search
published in: Theory of Stochastic Processes
review text: The authors give the scheme of an abstract economic search and then the search problem is put into a Hilbert space. The authors do this to link the search problem with the incremental approximation theory in a Hilbert space. The following result is presented. NEWLINENEWLINENEWLINEAssume in the search problem that: \((i)\) the reward variables and the search variables are the same with bounded second moments; \((ii)\) the cost function is identically equal to 1; \((iii)\) there is no discounting. Then \(R_{n}=\widetilde R_{n}+O(n^{-1/2})\), where \(\widetilde R_{n}\) is the expected net reward from the incremental search with bound \(n\) on the number of samples, and \(R_{n}\) is the expected net reward from the optimal non-sequential search with the same bound.
reviewed by: Aleksandr D. Borisenko
description: scientific article; zbMATH DE number 1646471