2019
DOI: 10.1088/1361-6544/aaf087
|View full text |Cite
|
Sign up to set email alerts
|

Applications of variable discounting dynamic programming to iterated function systems and related problems

Abstract: We study existence and uniqueness of the fixed points solutions of a large class of non-linear variable discounted transfer operators associated to a sequential decision-making process. We establish regularity properties of these solutions, with respect to the immediate return and the variable discount. In addition, we apply our methods to reformulating and solving, in the setting of dynamic programming, some central variational problems on the theory of iterated function systems, Markov decision processes, di… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(12 citation statements)
references
References 32 publications
0
12
0
Order By: Relevance
“…Remark 13.1 Let us observe here that X and A are nonempty sets. In the literature, discount maps δ and variable δ-discounted Bellman equations are studied in the case when X is a complete metric space, A is a metric space, B(X) is the set of all continuous bounded real-valued maps on X, (B(X), P) is a complete metric space, u and f are continuous, Ψ (x) is a compact set for each x ∈ X, and the dynamic system (B(X), B), B : B(X) → B(X), is a continuous generalized Matkowski contraction (see, e.g., [14,26,34]).…”
Section: Discount Maps δ and Convergence Existence And Uniqueness Rementioning
confidence: 99%
See 1 more Smart Citation
“…Remark 13.1 Let us observe here that X and A are nonempty sets. In the literature, discount maps δ and variable δ-discounted Bellman equations are studied in the case when X is a complete metric space, A is a metric space, B(X) is the set of all continuous bounded real-valued maps on X, (B(X), P) is a complete metric space, u and f are continuous, Ψ (x) is a compact set for each x ∈ X, and the dynamic system (B(X), B), B : B(X) → B(X), is a continuous generalized Matkowski contraction (see, e.g., [14,26,34]).…”
Section: Discount Maps δ and Convergence Existence And Uniqueness Rementioning
confidence: 99%
“…Concerning the Bellman functional equations (see [6][7][8]), variable δ-discounted Bellman equations (see, e.g., [14,26,34]) and Volterra integral equations (see [50]), most of the results contained in several works and books require such assumptions which (by using various techniques or by utilizing various known fixed point theorems) imply that the appropriate Bellman and Volterra operators are continuous (on suitable Banach spaces or complete metric spaces or sequentially complete locally convex vector spaces).…”
Section: Introductionmentioning
confidence: 99%
“…The notation and the main results in dynamic programming presented here are from [JMN14] and the results on discounted limits are from [CO19]. We consider a decision-making process S = {X, A, ψ, f, u, δ} given by:…”
Section: Dynamic Programming and The Boundary Of λmentioning
confidence: 99%
“…The notation and the main results in dynamic programming presented here are from [JMN14] and the results on discounted limits are from [CO19]. We consider a decision-making process S = {X, A, ψ, f, u, δ} given by: Assuming such hypothesis we can show that for each fixed 0 < λ < 1 there exists an unique Lipschitz continuous function v + λ which satisfies the Bellman equation…”
Section: Dynamic Programming and The Boundary Of λmentioning
confidence: 99%
“…In this section we show how one can construct equilibrium states using the spectral analysis of the transfer operator. The results present here are based on Theorem 3.27 of [CO17] which is a result about Dynamic Programming. In order to make its statement and this section as self-contained as possible we provided here the needed background.…”
Section: Applications and Constructive Approach To Equilibrium Statesmentioning
confidence: 99%