Functional equations in the theory of dynamic programming. XI: Limit theorems (Q773497): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q594813 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Richard Bellman / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3241581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Quasi-Linear Equation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3245701 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3266141 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5835072 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02843697 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2122178863 / rank | |||
Normal rank |
Latest revision as of 11:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Functional equations in the theory of dynamic programming. XI: Limit theorems |
scientific article |
Statements
Functional equations in the theory of dynamic programming. XI: Limit theorems (English)
0 references
1960
0 references
Let \(p\in P\) be a state vector of a discrete process and \(q\in Q\) a decision variable, which transforms \(p\) into \(T(p,q)\in P\). The transformation results in a ``return'' \(b(p, q)\ge 0\). Given \(p_1\), it is required to choose \(q = q_1, \ldots, q = q_n\) such that \(R_n = \sum_{i=1}^n b(p_i, q_i)\) is maximized, when \(p_{i+1} = T(p_i, q_i)\). The author proves that if it is possible for any \(p_a, p_b\) to find a \(q\in Q\) such that \(T(p_a, q) = p_b\), then for all \(p_1\in P\) we have \(\max_q R_N \sim Na\) as \(N\to\infty\), where \(a\) is independent of \(p_1\). It is mentioned that the existence of an asymptotic policy (i. e. choices of \(q)\) has not been proved. (For part X, written together with \textit{S. Lehman} see [Duke Math. J. 27, 55--69 (1960; Zbl 0096.14502)].)
0 references
functional equations
0 references
dynamic programming
0 references
limit theorems
0 references