Perov's Contraction Principle and Dynamic Programming with Stochastic Discounting
This paper shows the usefulness of Perov's contraction principle, which generalizes Banach's contraction principle to a vector-valued metric, for studying dynamic programming problems in which the discount factor can be stochastic. The discounting condition $\beta<1$ is replaced by $\rho(B)<1$, where $B$ is an appropriate nonnegative matrix and $\rho$ denotes the spectral radius. Blackwell's sufficient condition is also generalized in this setting. Applications to asset pricing and optimal savings are discussed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Some Limit Properties of Markov Chains Induced by Stochastic Recursive Algorithms
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empiric…
Integrated Artificial Neurons from Metal Halide Perovskites
Hardware neural networks could perform certain computational tasks orders of magnitude more energy-efficiently than conventional computers. Artificial neurons are a key component of these networks and are currently imple…
A Conditional Perspective on the Logic of Iterated Belief Contraction
In this article, we consider iteration principles for contraction, with the goal of identifying properties for contractions that respect conditional beliefs. Therefore, we investigate and evaluate four groups of iteratio…
Multiagent Value Iteration Algorithms in Dynamic Programming and Reinforcement Learning
We consider infinite horizon dynamic programming problems, where the control at each stage consists of several distinct decisions, each one made by one of several agents. In an earlier work we introduced a policy iterati…
reinforcement-learningReinforcement Learning (RL)Unified Analysis of Decentralized Gradient Descent: a Contraction Mapping Framework
The decentralized gradient descent (DGD) algorithm, and its sibling, diffusion, are workhorses in decentralized machine learning, distributed inference and estimation, and multi-agent coordination. We propose a novel, pr…