相关论文: Fixed Points of the Set-Based Bellman Operator
We consider finite-horizon Markov Decision Processes where parameters, such as transition probabilities, are unknown and estimated from data. The popular distributionally robust approach to addressing the parameter uncertainty can sometimes…
In this article, we discuss fixed point results for $(\varepsilon,\lambda)$-uniformly locally contractive self mapping defined on $\varepsilon$-chainable $G$-metric type spaces. In particular, we show that under some more general…
We consider parametric version of fixed-delay continuous-time Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is…
The linear Markov Decision Process (MDP) framework offers a principled foundation for reinforcement learning (RL) with strong theoretical guarantees and sample efficiency. However, its restrictive assumption-that both transition dynamics…
We study infinite-horizon Markov Decision Processes (MDPs) with a continuum of heterogeneous agents interacting through a common noise, without assuming exchangeability. We introduce the framework of Conditional Non-Exchangeable Mean Field…
In this paper we introduce an interlacing condition on the elements of a family of operators that allows us to gather together a number of results on fixed points and common fixed points for single and families of mappings defined on metric…
This paper shows the usefulness of the Perov contraction theorem, which is a generalization of the classical Banach contraction theorem, for solving Markov dynamic programming problems. When the reward function is unbounded, combining an…
We consider risk-sensitive Markov decision processes (MDPs), where the MDP model is influenced by a parameter which takes values in a compact metric space. We identify sufficient conditions under which small perturbations in the model…
In piecewise-deterministic Markov processes (PDMPs) the state of a finite-dimensional system evolves continuously, but the evolutive equation may change randomly as a result of discrete switches. A running cost is integrated along the…
While there is an extensive body of research on the analysis of Value Iteration (VI) for discounted cumulative-reward MDPs, prior work on analyzing VI for (undiscounted) average-reward MDPs has been limited, and most prior results focus on…
The paper discusses the conditions for the existence of fixed points of multivalued mappings that are not based on the linear structure of the set. The descriptions for the sets of fixed points for mappings with closed graph in compact…
We investigate weak-type $(1, 1)$ boundedness of sparse operators with respect to Lebesgue measure. Specifically, we find the Bellman function maximizing level sets of sparse operators (localized to an interval) and use this to find the…
We consider a Hilbert space that is a product of a finite number of Hilbert spaces and operators that are represented by "componental operators" acting on the Hilbert spaces that form the product space. We attribute operatorial properties…
Solving Markov Decision Processes (MDPs) remains a central challenge in sequential decision-making, especially when dealing with large state spaces and long-term optimization criteria. A key step in Bellman dynamic programming algorithms is…
We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…
We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…
In this paper, we introduce the neutrosophic contractive and neutrosophic mapping. We establish some results on fixed points of a neutrosophic mapping.
In this paper we introduce a framework for option model composition. Option models are temporal abstractions that, like macro-operators in classical planning, jump directly from a start state to an end state. Prior work has focused on…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
In this note, we discuss some fixed point theorems for contractive self mappings defined on a $G$-metric spaces. More precisely, we give fised point theorems for mappings with a contractive iterate at a point.